1.

Let L be a set accepted by a nondeterministic 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» B. 2|Q|


Discussion

No Comment Found