NFA to DFA Algorithm 1. Create a graph A, with initial vertex )(A, will be the DFA) 2. Repeat the following steps until there are no more missing edges: (a) Take any vertex (qu.qof A' that has a missing edge for some (b) Compute the transitions of each of these vertices under the cur- rent symbol and form the union of these results, producing the set (c) If it does not already exist, create a vertex for A' labeled (au,m, . gn) 3. Every state of A' whose label contains any g e F is labeled a final 4. If the NFA A accepts ?, the initial vertex {q.) is labeled a final (favorable) ( 9n) (d) Add an edge in A, labeled a from {G+93, (favorable) vertex ,%) to ,9m, ,g) vertex NFA to DFA Algorithm 1. Create a graph A, with initial vertex )(A, will be the DFA) 2. Repeat the following steps until there are no more missing edges: (a) Take any vertex (qu.qof A' that has a missing edge for some (b) Compute the transitions of each of these vertices under the cur- rent symbol and form the union of these results, producing the set (c) If it does not already exist, create a vertex for A' labeled (au,m, . gn) 3. Every state of A' whose label contains any g e F is labeled a final 4. If the NFA A accepts ?, the initial vertex {q.) is labeled a final (favorable) ( 9n) (d) Add an edge in A, labeled a from {G+93, (favorable) vertex ,%) to ,9m, ,g) vertex