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 been given an assignment to simulate an NFA in Java. Now the following regular expression that I have to simulate an NFA for is
ab*((b|d)|c*)
I think I have too many e-symbols. I was just wondering if the following image below is correct.
Your NFA graph is correct. It will match the regex
ab*((b|d)|c*)and nothing else. However, it could be much simpler, e.g. like this: