Regular expression to NFA-confusing regular expressions-:

R=(01+010)*

For it I made the below nfa which i believe seems correct. Plus the tutorials that I am following also make sure it’s correct. Q0 is initial state(forgot to mention in figure).





R=(01)*+(010)*



But idk how to convert this to NFA

What will be languages accepted by this NFA? Won’t it be the same as the above one?



(for some different question)

I got small hint about this. It was to add epsilon transition, but I don’t understand the need for it.



Source-: https://www.cs.wcupa.edu/rkline/fcs/nfas.html

 

This is too advanced for me. I have not taken this course. By the way, what is the name of this course? If you cannot find help here, try:

mathforums.com

freemathhelp.com

mathhelpboards.com

mathhelpforum.com

 

this course is theory of computation, formal lanaguages and automata theory

 

Thanks for letting me know. Visit the math sites suggested. There are great math tutors, teachers and professors there.