Chapter 3: The Theorv of Automata i;l 97
where
Q' = {[cI3], [qo, Q6], [ql' qs], [q:> q4], [q7]}
q'o = [qo, qd, r = [q3]
and 8' is defined by Table 3.24.
TABLE 3.24 Transition Table of Minimum State
Automaton for Example 3,14
State/I.
a
b
[qQ, q6]
[q1' q5]
[qQ, q6]
[q1' q5]
[qQ, q6]
[q2, q4]
[q2, q4]
[q31
[q1, q5]
[q3]
[q3]
[qQ' q6]
[q7]
[qQ, q6]
[q3]
Note: The transition diagram for lVI' is given by Fig. 3.15.
b
b
Fig. 3.15 Minimum state automaton of Example 3,14,
3.10 SUPPLEMENTARY EXAMPLES
EXAMPLE' 3.15
Construct a DFA equivalent to the l\i'DFA M whose transition diagram is given
by Fig. 3.16.
a, b
a, 0
q1
I
b
I
~ j'
q2
a
Fig. 3.16 NDFA of Example 3,15