1

Could you tell my if my solution is correct? I need to create a NFA which accepts binary strings (reading from right to left) if they are divisible by 5. My automata is below (green vertex is accepting one). Vertices are reminders mod 5. 0 is a starting vertex of course.

enter image description here

John Malick
  • 123
  • Why does state 1, have a transition to state 0 and to state 3 with input 1? Your automaton has many errors like this. For this type of problem a DFA would be easier to construct. – ultrainstinct Feb 29 '16 at 17:58
  • see this answer of mine binary property of divisibility by 5 part – Abr001am Feb 29 '16 at 18:38
  • Your automaton is very strange, since the letter $0$ acts as the identity and the letter $1$ allows you to go from any state $q$ to any state different from $q$. – J.-E. Pin Mar 01 '16 at 14:53
  • @john malick don't forget to accept one of the answers clicking the 'V' in the left side of the answer, and also to vote – 3SAT Mar 08 '16 at 19:32

1 Answers1

2

No it is not correcrt, the automata accepts $11_2=3_{10}$ and $3$ is not divisible by $5$

3SAT
  • 7,512