Let M be a nondeterministic finite automaton (NFA) with 6 states over a finite…
GATE · 2026 · CS · Set 1 · Computer Science & IT
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 𝑀 ?
- A.
32
- B.
65
- C.
1
- D.
128
Attempted by 119 students.
Sign up free to check your answer
Sign up freeLoading lesson…