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
① determined alphabet DFA, the initial state (initial state sets all the NFA)
② 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) Look and DFA NFA identification symbol strings are the same.
1, is provided with NFA M = ({0,1,2,3}, {a, b}, f, 0, {3}), where f (0, a) = {0,1} f (0, b) = {0} f (1, b) = {2} f (2, b) = {3}
State transition matrix shown, state transition diagrams, identification and description of the NFA is what kind of language.
|
a |
b |
0 |
{0,1} |
{0} |
1 |
- |
{2} |
2 |
- |
{3} |
3 |
- |
- |
· Figure:
Language: {(a | b) * abb}
2.NFA determine into DFA
1. Solution multifunctions: subset Method
NFA 1). Above the Exercise 1
|
|
a |
b |
A |
{0} |
{0,1} |
{0} |
B |
{0,1} |
{0,1} |
{0,2} |
C |
{0,2} |
{0,1} |
{0,3} |
D |
{0,3} |
{0,1} |
0 |
· Figure:
2) . P64 page Exercise 3
|
0 |
1 |
|
A |
S |
{V,Q} |
{Q,U} |
B |
{V,Q} |
{Z, V} |
{Q,U} |
C |
{Q,U} |
{V} |
{Q,U,Z} |
D |
{Z, V} |
{WITH} |
{WITH} |
E |
{V} |
{WITH} |
|
F |
{Q,U,Z} |
{V, Z} |
{Q,U,Z} |
G |
{WITH} |
{WITH} |
{WITH} |
· Figure:
2. Empty arc resolved: to find all the initial state and a new state ε- closure
1). Figure 2 distributed to you
|
0 |
1 |
2 |
|
a |
ε{A}={ABC} |
ε{A}={ABC} |
ε{B}={BC} |
ε{C}={C} |
b |
ε{B}={BC} |
|
ε{B}={BC} |
ε{C}={C} |
c |
ε{C}={C} |
|
|
ε{C}={C} |
· Figure:
2) .P50 3.6 FIG.
|
|
a |
b |
A |
e {0} = {01247} |
e {38} = {3612478} |
e {5} = {561247} |
B |
e {38} = {3612478} |
e {38} = {3612478} |
e {59} = {5612479} |
C |
e {5} = {561247} |
e {38} = {3612478} |
e {5} = {561247} |
D |
e {59} = {5612479} |
e {38} = {3612478} |
e {5,10} = {} 56127.10 |
E |
e {5,10} = {} 56127.10 |
e {38} = {3612478} |
e {5} = {56127} |
· Figure: