NFA to DFA Practice $1$

Create set $Q^{\text{'}}$

For each state in $Q_{\text{'}\text{n}\text{o}\text{t}\text{a}\text{l}\text{r}\text{e}\text{s}}$ nepresent

in the transition table:

a$.$ Create a row in the transition table

for the new state

b$.$ Determine the union of states

transitioned to from the new state $f$

each symbol. If there is no transitiol.,

go to the empty set $\frac{O}{?}.$ Each set

becomes a single state of the DFA.

c$.$ If a generated set is not already in Q$\text{'},$

add it to $Q\text{'}.$

Any state in the DFA that contains an NFA

accepting state, is an accepting state in the

DFA.