Q44,paer2 ,D 12. Let L be a set accepted by a non-deterministic finite automaton. The number of states in non-deterministic finite automaton is |Q|. The maximum number of states in equivalent finite automaton that accepts L is

(A) |Q|
(B) 2|Q|
(C)( 2^|Q|)-1
(D) 2^|Q|
Answer(D).
Power set construction method is to find the maximum number of states in DFA when NDFA is to be converted to DFA. When NDFA has Q states than power set will be having 2^Q states.