Regular Language and Finite Automata|| (1 Mark)||MCQ||2018

Last Updated :
Discuss
Comments

Let N be an NFA with n states. Let k be the number of states of a minimal DFA which is equivalent to N. Which one of the following is necessarily true?

[GATE 2018||MCQ|| 1-mark]


k ≥ 2n

k ≥ n

k ≤ n2

k ≤ 2n

This question is part of this quiz :

GATE||Regular Language and Finite Automata|| Pyq (2010 to2025),GATE||TOC || Pyq (2010 to2025)
Tags:
GATE CS
Theory of Computation
GATE CS
Share your thoughts in the comments
Article Tags :