1. 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 | {0,2} | |
| 2 | {0,3} | |
| 3 |
2.NFA determine into DFA
1. Solution multifunctions: Method subset
NFA 1). Above the Exercise 1
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
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
① 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.