Consider a DFA over Σ = {a, b} accepting all strings which have number of a’s…
GATE · 2001 · CS · Question 2 subparts
Consider a DFA over Σ = {a, b} accepting all strings which have number of a’s divisible by 6 and number of b’s divisible by 8. What is the minimum number of states that the DFA will have?
- A.
8
- B.
14
- C.
15
- D.
48
Attempted by 582 students.
Sign up free to check your answer
Sign up freeLoading lesson…