Consider a DFA over Σ = {a, b} that accepts all strings in which the number of…
GATE · Computer Science · 2001
Consider a DFA over Σ = {a, b} that accepts all strings in which the number of a's is divisible by 6 and the number of b's is divisible by 8. What is the minimum number of states required?
- A.
8
- B.
14
- C.
15
- D.
48
Attempted by 569 students.
Sign up free to check your answer
Sign up freeLoading lesson…