Given an NFA M it can be converted to a DFA M1.

1. Determine the states in M1. If M has n states then M1 has 2n states.

2. Label each of M1's states with the corresponding subset of M's states.

3. Determine M1's start and accepting states.

Start state is the set of states reachable from M's start state via the ε arrows plus the M's start state.

4. Determine M1's transition function.



For Example