
8.40 | Chapter 8
5
x
2
1
0
01
4
00
1
0
01 11 10
G
C
A
BD
EF
FIGURE 8.27 | K-map
Set a three-variable K-map as shown in Figure 8.27. Try to adjust as many as possible tar-
geted adjacent states. Give top priority to Rule 1 targeted adjacent state pairs then to Rule2
and Rule 3. [A, G] states are targeted two times, so have top priority. One of the possible
state assignments is given as below.
[A, G], [C, D], [E, F], [A, C], [B, D] and [E, F, G] are adjusted in K-map to follow adjacent
assignments.
So, A → 000, B → 111, C → 100, D → 101, E → 001, F → 011 and G → 010.
ExamplE 8.15 State table of a sequential machine is shown in Table 8.28. Make suitable ...