Show how to make a simple NFA for language r1r2.

Suppose NFA1 is a machine for the regular expression r1 and NFA2 for the regular expression r2. Further suppose that NFA1 has only one +…

Suppose NFA1 is a machine for the regular expression r1 and NFA2 for the regular expression r2. Further suppose that NFA1 has only one + state and that this state has no edges leading out of it (even back to itself). Show how to make a simple NFA for the language r1r2.  
Let’s block ads! (Why?)

Do you need any assistance with this question?
Send us your paper details now
We’ll find the best professional writer for you!

 



error: Content is protected !!