The request
“An NFA over {0, 1} for strings ending in 01. The start state S loops on 0 and 1 and guesses the last two symbols through A to the accepting state B.”
Then tryConvert this NFA to a DFAChange it to strings ending in 011
What is in this drawing
Read the decisions behind it.
01
Adding state 'A' to remember a 0 before a 1
02
Using non-determinism to start pattern on any 0
03
Marking accepting state 'B' with a note instead of terminal state to allow ongoing transitions
When modeling finite state machines for pattern recognition in theoretical computer science or compiler design classes.
More like this