Digital Design_ Principles and Practices, Chegg Solution Manual_parte_314

Prévia do material em texto

Step 1 of 2 7.23DP Refer Table 7-15 in the textbook. If the other two unused states were considered as don't-cares then the three variable map is completely filled resulting in = 1 It makes the guessing game machine run with a combinational logic if we consider the unused states as don't-cares, as the value of is always 1 irrespective of the inputs and the transition expressions as shown in the Table 7-15. Step 2 of 2 If always = 1 in the guessing game machine then the machine will never go back to game it oscillates in the states SOK and SERR, which makes the machine useless.