A sequential circuit has an input X and outputs (Yand Z).

Chapter 14, Problem 14.40

(choose chapter or problem)

A sequential circuit has an input X and outputs (Y and Z). YZ represents a 2-bit binary number equal to the number of pairs of adjacent 1’s that have been received as inputs. For example, the input sequence 0110 contains one pair, the sequence 01110 two pairs, and the sequence 0110111 contains three pairs of adjacent 1’s. The circuit resets when the total number of pairs of 1’s received reaches four. Find a Moore state graph and table for the circuit.

Examples:

Input sequence:       X = 0 1 0 1 1 0 1 1 1 0 0 1 0 1 0 1 0 1 1 1 0 1 1 0 1 1 0 0 1 0

Output sequences:   Y = 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 1 1 1 1 1

                                 Z = 0 0 0 0 1 1 1 0 1 1 1 1 1 1 1 1 1 1 0 0 0 0 1 1 1 0 0 0 0 0

Input sequence:       X = 1 1 1 1 1 1 1 1

Output sequences:   Y = 0 0 1 1 0 0 0 1

                                  Z = 0 1 0 1 0 0 1 0

(Hint: Be sure that the circuit resets as shown in the examples.)