GATE | GATE-CS-2001 | Question 6

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


Answer: (B)

Explanation: Refer http://en.wikipedia.org/wiki/Powerset_construction

Quiz of this Question



My Personal Notes arrow_drop_up

Recommended Posts:



    Article Tags :

    Be the First to upvote.


    Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.