NFA without ε-transitions which recognizes the language generated by the regular expression

Question

NFA without ε-transitions which recognises the language generated by the regular expression:

1(0 + 0(10)*0)0

Do you know to convert regular expressions to NFA? It's a standard application of this procedure. — Siddharth Bhat, Apr 28 '16 at 16:06

score 1 · Answer 1 · answered Apr 29 '16 at 11:35

1

Here is a possible NFA for the language $1(0 + 0(10)^*0)0$:

answered Apr 29 '16 at 11:35

J.-E. Pin

score 0 · Answer 2 · answered Apr 28 '16 at 16:45

0

I think you can add a branch in second 0-transitions to take a union operation. It is feasible in NFA. Here is a required NFA.

answered Apr 28 '16 at 16:45

Simon Shan

are u sure about your answer? – Paul Apr 28 '16 at 16:49
I think your addition operation is union operation on Sipser's Book. Is there any problem? – Simon Shan Apr 28 '16 at 17:11
Your automaton does not seem to accept $1000$. – J.-E. Pin Apr 29 '16 at 11:11

2 Answers2