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) N2
(B) 2N
(C) 2N
(D) N!
Answer: (B)
Explanation: Refer http://en.wikipedia.org/wiki/Powerset_construction
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...