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
2). P64 page Exercise 3
2. Solve the empty arc
1). Figure 2 distributed to you
2) .P50 3.6 FIG.
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
2). P64 page Exercise 3
2. Solve the empty arc
1). Figure 2 distributed to you
2) .P50 3.6 FIG.