Binary Number when interpreted as decimal mod 12

Question

What are the Number of states in minimum DFA that accepts Binary  strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.

Comments

http://stackoverflow.com/questions/21897554/design-dfa-accepting-binary-strings-divisible-by-a-number-n

it may help you

Answer 1

I m getting 5 states

	0	1
-> q0 (F)	q0	q1
q1	q2	q3
q2	q1	q2
q3	q4	q1
q4	q0	q1

Comments

Why did you use only 5 states here ? Can you be more clear about this explanation .?

---

A number is divisible by 12 , if it is divisble by 3 as well as divisible by 4.

Make 2 dfas for :
1) divisibility by 3
2) divisibility by 4 :

         For divisibility by 4 , a binary number must end with '00'.

>> you can try to make product automaton & then minimize it.

---

Detail explanation about how to draw Transition table for this kind of questions :

Click me

Answer 2

state	0	1
>>q0(Final)	q0	q1
q1	q2	q3
q2	q1	q2
q3	q4	q1
q4	q0	q1

Corrected now...Thanks to Amsar Sokt

Comments

I m getting 5 states

	0	1
-> q0 (F)	q0	q1
q1	q2	q3
q2	q1	q2
q3	q4	q1
q4	q0	q1

you do check..