Chapter 3: The Theory of Automata ~ 89
-~-TABLE 3,16 Moore Machine of Examp!e 3.11
Present state
Solution
a = 0
Next state
a = 1
Output
o
o
1
We construct the transition table as in Table 3,17 by associating the output
\vith the transitions.
In Table 3.17. the rows cOlTesponding to '1: and '1." are identical. So. we can
delete one of the two states. i.e. if: or {h. We delete if.". Table 3,18 gives the
reconstructed table.
TABLE 3,17 Transition Table for Example 3.11
Present state
Next state
a = 0
a = 1
state
output
state
output
-:;.Gi
q:
0
q2
0
q2
q"
0
q3
1
q3
q"
0
q3
1
TABLE 3,18 Mealy rJlachine of Example 3.11
Present state
Next state
a = 0
a =
- - - , , - - - - - - - - - - - - _...In Table 3.18. we have deleted the '1.,,·1'ow and replaced '10, by '12 in the other
rows.
-
~-- . ~ -~
-
EXAMPLE 3.12
Consider a Mealy machine represented by Fig. 3.10, Construct a Moore
machine equivalent to this Mealy machine.