Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
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:
Am I completely off the mark? Or somewhat there?
NB E => ε
Your NFA matches the same language as
(a*|b*)*, so the answer is correct.However, there are many NFAs that match the same language and in your case it would be possible to remove at least three epsilon arrows. Still, it will not be more correct than your suggestion.
The regex
(a*|b*)*can also be simplified, without changing the semantics. E.g.(a|b)*is equivalent to(a*|b*)*. And if you think about it, the FA can be as simple as this: