Transforming-lambda-NFA-to-DFA

About

This program implements the algorithm for transforming a lambda-NFA(NFA with NULL transition) into a DFA as well as a word parser for the automata.

All throughout the code the lambda symbol is reprezented by '$'.

Input

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

Q - the set of states

Sigma - the alphabet

q0 - the intial state

F - the final states

delta - the transition function

Here is an example:

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

Output

The to_dfa_table function will return a dictionary reprezenting the delta function of the new dfa, the new initial state and the new final states of the dfa.