MCQ
Q.
Maximum number of states of a DFA converted from an NFA with nstates is?
Correct Answer: C
Take the NFA with states {qo,q1}, alphabet ?={a}, initial state q0, transitions ?(q0,a)=q0, ?(q0,a)=q1 and final state q1. It generates the same language as the DFA with the same set of states and alphabet, but transitions ?(q0,a)=q1 and ?(q1,a)=q1.