GATE | GATE-CS-2001 | Question 6

Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least
(A) N²
(B) 2^N
(C) 2N
(D) N!

Answer: (B)
Explanation: Refer http://en.wikipedia.org/wiki/Powerset_construction
Quiz of this Question