0 votes 0 votes For Σ = {a, b}, construct a DFA that accepts the sets consisting of: all the strings with an even number of a’s and the number of b’s is a multiple of 3. Note that 0 is an even number and a multiple of 3. Theory of Computation theory-of-computation finite-automata strings + – Garrett McClure asked Sep 6, 2017 Garrett McClure 6.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes It's just a combination of two DFAs: (i) even number of a's; and (ii) number of b's to be multiple of 3. Rishabh Gupta 2 answered Sep 6, 2017 • selected Sep 6, 2017 by Garrett McClure Rishabh Gupta 2 comment Share Follow See all 0 reply Please log in or register to add a comment.
