Let Σ = {1,2,3,4}. For x ∈ Σ*, let prod(x) be the product of symbols in x modulo 7. We take prod(ε) = 1, where ε is the null string. For example, prod(124) = (1 × 2 × 4) mod 7 = 1. Define L = {x ∈ Σ* | prod(x) = 2}. The number of states in a minimum state DFA for L is ________. (Answer in integer)

GATE 2025 CSE & IT Q60 — Computer Science

GATE 2025Set 2Q60NATanswer keyexplanation soonhard

Computer Science · Theory of Computation - Automata Theory

Concept intelligence

Drill mode: Regular Languages · 5/47

Your answer

Studying seriously for GATE CSE?

Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.

Recurring concept

Theory of Computation - Automata Theory has appeared in GATE CSE & IT 4 times across 2 years (2017, 2025).

More questions on Theory of Computation - Automata Theory

∑ has math

DFAAutomataModulo ArithmeticRegular Languages