Give an example problem of converting NFA to DFA.

Problem

Consider a Non-deterministic finite automata (NFA) and convert that NFA into equivalent Deterministic Finite Automata (DFA).

Solution

Let’s construct NFA transition table for the given diagram −

DFA cannot have multiple states. So, consider {q0,q1} as a single state while constructing DFA.

Let’s convert the above table into equivalent DFA

In DFA the final states are q2 and q3, wherever q2 and q3 are present that state becomes a final state.

Now the transition diagram for DFA is as follows −