All

This can be done using subset construction, where the DFA is given a state for each reachable combination of states in the NFA.

Follow the instructions below to convert the NFA on the left.

**non-deterministic**finite state machines (NFA) can be converted into equivalent**deterministic**machines (DFA).This can be done using subset construction, where the DFA is given a state for each reachable combination of states in the NFA.

Follow the instructions below to convert the NFA on the left.