Automata question :-- Design a DFA over ∑= {a, b} accept strings having a’s multiple of 3 and b’s multiple of 2.

Question

Can anyone help me to solve this..

Answer 1

Initial state --> q0
Final state --> q8

--> q0 -- b --> q3 -- b --> q8
|. |. |
a. a. a
|. |. |
q1 -- b --> q4 -- b --> q7
|. |. |
a. a. a
|. |. |
q2 -- b --> q5 -- b --> q6

Including this

q2 -- a --> q0
q5 -- a --> q3
q6 -- a --> q8

q8 -- b --> q3
q7 -- b --> q4
q6 -- b --> q5

if you didn't understand, then go through online tutorials