Question

I have a question regarding the conversion of regular expressions to non-deterministic finite state automata:

Convert (a*|b*)* to NFA. My attempt is as follows:

enter image description here

Am I completely off the mark? Or somewhat there?

NB E => ε

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with StackOverflow
scroll top