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
3. NFA and DFA to see if the identified symbol string consistent.
Exercise:
1. Solution multifunctions: Method subset
1). Figure 1 distributed to you
| a | b | ||
| A | 0 | 01 | 0 |
| B | 01 | 01 | 02 |
| C | 02 | 01 | 03 |
| D | 03 | 01 | 0 |
2). P64 page Exercise 3
2. Empty arc solution: seeking ε- closure of all the initial state and a new state
1). Figure 2 distributed to you
| 0 | 1 | 2 | ||
| 0 | ε{A}={ABC} | ε{A}={ABC} | ε{B}={BC} | ε{C}={C} |
| 1 | {BC} | ε{B}={BC} | ε{C}={C} | |
| 2 | {C} | ε{C}={C} |
2) .P50 3.6 FIG.
