106 ~ Theory of Computer Science
TABLE 3.35 Finite Automaton of Exercise 3.14
State
Input
a
b
-}qo
qo
q3
q,
q2
q5
q2
q3
q4
q3
qo
q5
q4
qo
q6
q5
q1
q4
@
q1
q3
3.15 Construct a minimum state automaton equivalent to the DFA described
by Fig. 3.18. Compare it with the DFA described by Fig. 3.19.
3.16 Construct a minimum state automaton equivalent to the DFA described
by Fig. 3.22.
o
o
~
I-----.~---_. . . .
tJ
0.1
Fig. 3.22 DFA of Exercise 3.16.