Let Σ= {a}, assume language, L= { a^(2012.K) / K> 0}, what is minimum number of states needed in a DFA to recognize L

Question

In my opinion it should be 2012 but I am not sure.Thanks for the help.

Answer 1

States are 2013..

from S0 to S2012.. S2012 is final state, S0 is starting..

transition from S0--->S1--->......S2012 ---> S1..