Design a DFA over the alphabet Σ={a,b} that accepts all strings where the…
Design a DFA over the alphabet Σ={a,b} that accepts all strings where the number of a's is divisible by 2, and the number of b's is divisible by 2. What is the minimum number of states required for this DFA?
Answer: 4
Attempted by 53 students.
Show answer & explanation
Correct answer: 4
Loading lesson…