theory of computer science

A deterministic finite automaton (DFA) can be seen as a special kind of NFA, in which for each state and symbol, the transition function has exactly one state. Thus, it is clear that every formal language that can be recognized by a DFA can be recognized by an NFA. Code in python, please use parser.py provide in a zip file and implement the code in main.py which I provided in a zip file