ANSWER THE FOLLOWING QUESTIONS ON YOUR NFA FIRST
1. There are
states. 2. Initial state is
.
3. Accepting states are
.
Type in states separated by commas without {}.
Fill out the Transition Table and click Submit.
Do not forget { } for the next states.
Do not type in empty transitions.
State Transition Graph
State Transition Table
State
Input
Next States
state=0
state=1
state=2
state=3
a
b
state=0
state=1
state=2
state=3
a
b
state=0
state=1
state=2
state=3
a
b
state=0
state=1
state=2
state=3
a
b