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.
Language: ε
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.