Convert the following Non-Deterministic Finite Automata (NFA) to Deterministic Finite Automata (DFA).
The transition diagram is as follows −
The transition table of NFA is as follows −
The DFA table cannot have multiple states. So, make q0q1 as a single state.
Let’s convert the given NFA to DFA by considering two states as a single state.
The transition table of DFA is as follows −
In the above transition table, q2 is the final state. Wherever, q2 is present that becomes the final state.
Where n= number of states in DFA
m= number of states in NFA