Questions

Question

How many number of states are there in the minimized dfa that accepts the language L= a^ 3(n+1)

Comments

for n>=0

L={a^3,a^6,a^9...............}

dfa will have 4states. (one a from last state will goto 2nd state)

Answer 1

4 state is required.