Transition0 |
1 |
|
 |
|
|
 |
 |
|
 |
 |
 |
{  } |
|
|
 |
|
|
 |
|
|
 |
|
|
 |
|
|
The start state of the DFA is - closures 
The final states are all those subsets that contains 
(since 
in the NFA).
Let us compute one entry,
Similarly, all other transitions can be computed.