
10.12 DESIGN OF SIMPLE SYNCHRONOUS STATE MACHINES 471
Algorithm 10.1:D → T K-map Conversion (Refer to Eq. 10.19)
(1) For all that is NOT A in the D
A
K-map, transfer it to the T
A
K-map directly (
¯
AT
A
).
(2) For all that is A in the D
A
K-map, transfer it to the T
A
K-map complemented (A
¯
T
A
).
(3) Repeat steps (1) and (2) for the D
B
→ T
B
and D
C
→ T
C
, etc., K-map conversions.
Notice that the word “complemented,” as used in the map conversion algorithm, refers to
the complementation of the contents of each cell in the domain indicated.
10.12.2 Design of a Sequence Recognizer: D-to-JK K-map Conversion
It is required to design a sequence recognizer that will issue an ...