Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite…

PYQ GATE 2026

Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite alphabet.

Which of the following options CANNOT be the number of states in the minimal deterministic finite automaton (DFA) that is equivalent to 𝑀 ?

  1. A.

    32

  2. B.

    65

  3. C.

    1

  4. D.

    128

Attempted by 162 students.

Sign up free to check your answer

Sign up free

Explore the full course: Theory Of Computation

Loading lesson…