There are basically two classes in the program:a) NFA from regexb) NFA to DFA

displayNFA(self) used to display NFA

displayDFA(self) used to display DFA

buildDFA() is used to build DFA

buildNFA() is used to build NFA

The rest of the operations are defined in Class Automata which forms the backbone of the program by taking into account the precedence of operators while evaluating postfix operations.

BuildAutomata class is used to define plus and dot structure for defining the rules involved when using * , . and plus operator

Test cases:

1. a+2. a+b*c3. (abc)*

The operators taken are

1. +: or2. *: Kleene Closure3. .: Concatenation