GATE CSE 2025 Session 2 Q60: Minimal DFA for strings whose digit product mod 7 is 2
- Theory of Computation
- 2 marks
- NAT
- No negative marking
Question
Let . For , let be the product of symbols in modulo 7. We take , where is the null string.
For example, .
Define .
The number of states in a minimum state DFA for is ___________. (Answer in integer)
Try it: numerical answer: type the value
Show answer and explanation
Answer: 6 (official GATE 2025 final answer key)
Concept used: Track the running product modulo 7; the symbols 1–4 are all invertible mod 7, so the product is never 0.
First step: States are residues ; check that all are reachable from 1 (3 generates the group) and pairwise distinguishable.
Full step-by-step solution
Detailed working, common mistakes and linked mock tests will be available with a free GATEiit account. Log-in is coming soon.
Share this question
Source: official GATE 2025 Session 2 CS question paper and final answer key, organised by IIT Roorkee. Question paper · Answer key
More Theory of Computation PYQs
- 2026 Session 1 · Q25Ambiguity of S → aSbS | bS | ε
- 2026 Session 1 · Q26Impossible minimal DFA sizes for a 6-state NFA
- 2026 Session 1 · Q51What follows from L1 ∩ L2 and L2 being regular
- 2026 Session 1 · Q52Counts of a's and b's in strings of a given CFG
- 2026 Session 2 · Q13Meaning of a Turing machine deciding a language
- 2026 Session 2 · Q29Which of four grammars are ambiguous