Computer Sciences > GATE 2026 SET-1 > Finite Automata
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
65
B
1
C
32
D
128

Correct : a,d

The key rule is: an NFA with n states can be converted to a DFA with at most 2n states using the subset construction algorithm.
For a 6-state NFA: maximum DFA states = 26 = 64.
The minimal DFA can have anywhere from 1 to 64 states.
Checking each option:
A: 65 - 65 > 64 → CANNOT happen
B: 1 - 1 ≤ 64 → CAN happen (e.g., NFA for Σ* gives a 1-state DFA)
C: 32 - 32 ≤ 64 → CAN happen
D: 128 - 128 > 64 → CANNOT happen
So the answers that cannot be the number of states in the minimal DFA are A (65) and D (128).

Similar Questions

Which one of the following regular expressions correctly represents the language of the finite automaton given below?
#783 MCQ
A regular language L is accepted by a non-deterministic finite automaton (NFA) with n states. Which of the following statement(s) is/are FALSE?
#1371 MCQ
Consider the following deterministic finite automaton (DFA) defined over the alphabet, Σ={a,b}. Identify which of the following language(s) is/are accepte...
#1393 MCQ

Related Topics

GATE CS 2026 GATE CS 2026 Set-1 Q21 NFA to DFA 6-State NFA Minimal DFA States Subset Construction 2 Power n States Maximum DFA States Theory of Computation GATE Finite Automata GATE 2026 GATE CS 2026 Solved NFA DFA Conversion State Count DFA

Unique Visitor Count

Total Unique Visitors

Loading......