First   |   Last   |   Prev   |   Next

1. If is the start state of the NFA, then make - closure ( ) the start state of the equivalent DFA . This is definitely the only accessible state.

If we have already computed a set of states which are accessible. Then . compute because these set of states will also be accessible.

Following these steps in the above example, we get the transition table given below

	0	1

First   |   Last   |   Prev   |   Next