Question: In class we learned an algorithm for converting a regular expression into a NFA. Apply the conversion algorithm to the regular expression a'+b and answer
In class we learned an algorithm for converting a regular expression into a NFA. Apply the conversion algorithm to the regular expression a'+b and answer the following questions about the resulting NFA. Type a single digit for each answer. How many states are in your NFA? 2 How many arrows are labeled lambda? 0 How many arrows point at your accept state? 2 Answer 1: 2 Answer 2: 0 Answer 3: 2 MEBOOK
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
