Skip to content
Related Articles

Related Articles

GATE | GATE-CS-2001 | Question 6
  • Last Updated : 20 Nov, 2019

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

sudo-gate-course

My Personal Notes arrow_drop_up
Recommended Articles
Page :