o
o
0
Chapter 3: The Theory of Automata ,!;l 93
EXAMPLE 3.13
Construct a minimum state automaton equivalent to the finite automaton
described by Fig. 3.12.
Fig. 3.12 Finite automaton of Example 3.13.
Solution
It will be easier if we construct the transition table as shown in Table 3.21.
TABLE 3.21 Transition Table for Example 3.13
StatelI.
-'tqo
q1
® q3
q4
qs
q6
q7
By applying step 1, we get
Q? = F = {Q21,
So.
o
o
0
Chapter 3: The Theory of Automata ,!;l 93
EXAMPLE 3.13
Construct a minimum state automaton equivalent to the finite automaton
described by Fig. 3.12.
Fig. 3.12 Finite automaton of Example 3.13.
Solution
It will be easier if we construct the transition table as shown in Table 3.21.
TABLE 3.21 Transition Table for Example 3.13
StatelI.
-'tqo
q1
® q3
q4
qs
q6
q7
By applying step 1, we get
Q? = F = {Q21,
So.
o