NFA into a DFA determine
Child collection method:
Subset f (q, a) = {q1, q2, ..., qn}, the state set
The {q1, q2, ..., qn} regarded as a state A, to record the set of all possible states achieved after NFA reads input symbol.
step:
1. The conversion matrix configuration DFA state NFA
Determining the initial state ① DFA (NFA sets all initial state), the alphabet
② From the initial state, the state set alphabet arrived as a new state
③ adding a new state to the current DFA state
④ Repeat step 23 until no new DFA state
2. Draw DFA
Exercise:
1. distributed to everyone in Figure 1
2. P64 page Exercise 3
|
|
a |
b |
|
| 0 |
e {0} = {01247} |
e {38} = {1234678} |
e {5} = {124567} |
| 1 |
{1234678} |
e {38} = {1234678} |
e {59} = {1245679} |
| 2 |
{124567} |
e {38} = {1234678} |
e {5} = {124567} |
| 3 |
{1245679} |
e {38} = {1234678} |
to {510} = {12456710} |
| 4 |
{12456710} |
e {38} = {1234678} |
e {5} = {124567} |
