Question

Number of state in dfa if number of a's divisible by 6 and number of b's divisible by 8

Answer 1

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? Explanation: We construct a DFA for strings divisible by 6.