Let be a non-deterministic 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 ?
- A32
- B65
- C1
- D128
Theory of Computation (TOC)Regular Expressions & Finite Automata (DFA/NFA Min)MSQ1 markMedium
A GATE question every morning
One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.