RTUComputer ScienceYr 2024 · Sem 42024

Q2Theory of Computation

Question

4 marks

Convert the given NFA to an equivalent DFA.

Answer

Subset construction method.

To convert NFA to DFA: (1) Create start state as ε-closure of NFA start state. (2) For each DFA state and input symbol, find the set of NFA states reachable. (3) Mark states containing NFA final states as DFA final states.

Back to Paper