Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

GATE | GATE-CS-2001 | Question 6

  • Last Updated : 28 Jun, 2021

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

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!