Question

construct a DFA to accept all strings which satisfy w(x)mod 5 =2 .

Answer 1

Start state =q0 and Final state =q2

Comments

it doesn't accept string 11011

---

it does q0 ==>q1 ==> q3 ==> q1 ==> q3 ==> q2   How about this ?

---

done...ok got it.

Answer 2

State	0(Input alphabet)	1(Input aphabet)
q0	q0	q1
q1	q2	q3
*q2	q4	q0
q3	q1	q2
q4	q3	q4

Now by above state table draw DFA and make q2 as a final state bcz     w(x)mod5=2