Question
Let . For , let be the product of symbols in modulo . We take , where is the null string.
For example, .
Define .
The number of states in a minimum state DFA for is ___________. (Answer in integer)
Official answer and solution
- Official answer
- 6
- From
- Official GATE 2025 answer key
Solution
Determine which non-zero residues modulo 7 are reachable from 1 by multiplying symbols from and show that all reachable residues are pairwise distinguishable.
- Reachable residues: Since is prime and every symbol in is non-zero modulo , can only take values in the multiplicative group (residue is unreachable). Furthermore, is a primitive root modulo (), so all non-zero residues are reachable from the initial state .
- Pairwise distinguishability: For any two distinct residues , choose such that (using string ). Since , we have , so distinguishes and .
By the Myhill-Nerode Theorem, the minimum-state DFA for has exactly states.
6
Including a 7th state for residue 0, which is unreachable since 0 is not in the alphabet.
The answer is the one in the official GATE answer key. The solution is this site's own explanation.
Source
- Paper
- GATE 2025 Computer Science and Information Technology - Session 2 (CS2)
- Question
- 60 of 65
- Section
- Computer Science and Information Technology
Report an error in this question
GATE questions are the work of the organising institutes. This site is independent and is not affiliated with them.