Let N be an NFA with n states and let M be the minimized DFA with m states…

PYQ GATE 2008

Let N be an NFA with n states and let M be the minimized DFA with m states recognizing the same language. Which of the following in NECESSARILY true?

  1. A.

    m ≤ 2n

  2. B.

    n ≤ m

  3. C.

    M has one accept state

  4. D.

    m = 2n

Attempted by 582 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…