Nondeterministic-Deterministic-Finite-Automata

About

This program presents a simple way to implement a NFA/DFA in python.

Input

The characteristics of the NFA/DFA have to be written in the automata.in file as such:

q0 #initial state

F #list of final states

state letter state #defining the transition function delta

state letter state #defining the transition function delta

...

Here is an example:

The words which are to be parsed will be written in the words.in file as such: