confusion in finding states in minimal DFA

Question

number of states in the dfa which accepts the binary strings whose decimal equivalent is divisible by 5 ?

 

since ∊ is not accepted as it doesn't have any decimal equivalent so

initial state cannot be accepting state so to accept 0 (zero) there should be some other state than the initial state .

 

so what will be the answer 5 or 6

Answer 1

5 states required for it .

state 0: num mod 5=0 or you can say all the numbers divisible by 5 falls here  this is the final state indeed

state 1: num mod 5=1 falls here

state 2: num mod 5=2 falls here

state 3: num mod 5=3 falls here

state 4: num mod 5=4 falls here

 

your query:0 is divisible by 5 so no need to take extra care of it... it falls in the state 0