Finite Automata & Nfa

L = {a^k / k is divisible by 6 or 10 (or both)}

Give a DFA and NFA for the above.

Can anyone do it?

My 2 cents:
This is my DFA for the above language.

(q_x) = accepting state where x is any integer.

>q_0-->q_1--> ... (q_6)....q_28--->(q_30)

Last edited: