Computer Sciences > GATE 2025 SET-2 > Finite Automata
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)
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)
Correct : 6
Similar Questions
Which one of the following regular expressions correctly represents the language
of the finite automaton given below?
Which one of the following regular expressions correctly represents the language
of the finite automaton given below?
Which one of the following regular expressions correctly represents the language
of the finite automaton given below?
Total Unique Visitors
Loading......