Question

The diagram represents an intermediary step in the algorithm to convert NFA to regular expression. If node 0 is removed, what will be the edge from s to 1 (also denoted by new(s,1)) labeled as ?The diagram represents an intermediary step in the algorithm to convert NFA to regular expression. If node 0 is removed, what will be the edge from s to 1 (also denoted by new(s,1) labeled as? ab sbo abb*a O ab ab O aab

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Option 3 correct.

  • Here we remove state1, the input of state1 is ab.
  • The output of state1 is b or the null string.
  • To remove 1 it must be included to previous state that is s(start state).
  • So the start state s edge from s to 1 is ab*ab
  • ab*ab b* is null it is aab which is true.
Add a comment
Know the answer?
Add Answer to:
The diagram represents an intermediary step in the algorithm to convert NFA to regular expression. If...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT