ANSWER THE QUESTIONS AFTER YOU FILL OUT THE TABLE
1. The converted DFA has
states.
2. Initial State Set contains
.
3. Accepting State Set contains
.
List states of NFA separated by commas. Separate DFA states by semicolon. For example 0;1,3,4;2,3 for accepting states {0}, {1,3,4},{2,3}
Denote the states of DFA as a set such as {1,3}.
Use {#} to denote the empty state.
States Transition Graph
States Transition Table
State
Input
Next States
a
b
a
b
a
b
a
b
a
b
a
b
a
b
a
b
a
b
a
b
a
b