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 M?
Solution :
The correct option is 65.
To understand why this is the correct answer, we can analyze the relationship between the number of states in a Nondeterministic Finite Automaton (NFA) and its equivalent Minimal Deterministic Finite Automaton (DFA) using the subset construction method.
Given an NFA with states, the standard power-set construction (or subset construction) algorithm creates an equivalent DFA. Since each state in the DFA corresponds to a subset of the states of the NFA, and a set with elements has possible subsets, the maximum number of states in the equivalent DFA is:
This upper bound represents the maximum possible states before minimization. Since a minimal DFA is obtained by merging equivalent states of the DFA, its number of states must be less than or equal to the number of states in the DFA obtained via subset construction.
For an NFA with states:
Therefore, the equivalent minimal DFA can have at most 64 states.
Comparing the given options:
- 32 is less than or equal to 64, so it is a possible number of states.
- 1 is less than or equal to 64, so it is a possible number of states.
- 65 is strictly greater than 64, making it mathematically impossible to be the number of states in the minimal DFA.
(Note: While 128 is also greater than 64, the option 65 is identified as the correct choice here.)
Completely free for students. Educators & coaching institutes get 2 months free Pro trial to create tests.
Access unlimited practice questions, detailed step-by-step solutions, and exam study materials — completely free for students.
Create and conduct professional online assessments with AI question generation, tab proctoring, and comprehensive batch management.
Prepare for GATE 2026 Civil Engineering with the latest question papers, previous year papers, detailed solutions, syllabus, exam pattern, preparation tips, mock tests, and subject-wise study material. Download GATE 2026 CE question papers with solutions in PDF format and boost your preparation for top engineering institutes and PSU recruitment.
Prepare effectively for GATE 2026 Electronics & Communication Engineering (EC) with this comprehensive Question Paper with Solutions. This resource includes detailed explanations, concept-wise solutions, previous year paper analysis, and exam-oriented practice to help aspirants strengthen core subjects like Electronic Devices, Analog Circuits, Digital Circuits, Signals & Systems, Network Theory, Control Systems, Electromagnetics, Communications, and more. Perfect for revision, self-assessment, and boosting your GATE 2026 EC preparation strategy.
Copyright © 2026 Combe Labs Private Limited. All Rights Reserved.