# How do we obtain a dfa to accept strings of a’s and b’s such that l = {w| w ∈ (a + b)* } such that na(w) mod 3 = 0 and nb(w) mod 2 = 0?

It's an assignment question but I do not completely understand how to do it. I have basic knowledge in the subject, I just need some help as soon as possible.

• What exactly do you not "completely understand"? Did you revise the definition for DFAs? Do you fully understand the notation used in the question? You cannot simply expect us to do your homework for you (and especially not "as soon as possible"). – dkaeae Jan 10 at 14:56
• Could you do half the problem, namely $n_a(w)\bmod 3\equiv 0$ ? – Rick Decker Jan 10 at 16:58