Consider the following state-transition diagram:
For each of the following questions, assume that the machine starts in state A.
A. Give the sequence of states visited, and the sequence of outputs produced, if a machine described by the above state-transition diagram is presented with the input string 00110.
B. What is the only string of inputs that will yield an output string composed entirely of Os?
C. The state-transition diagram is implemented in a clocked sequential machine, shown below, consisting of a register of positive edge-triggered D flip-flops and module," which is purely combinational logic. How many state variables are needed?
D. Give a truth table for the Q module such that the sequential machine sketched above implements the desired state-transition diagram. Make sure that the initial state (A) corresponds to all state variables being zero.
E. Reproduce the diagram below and fill in the line for the output for the sequential machine using the Q module and D flip-flops. You may neglect propagation delays in the logic, assuming them to be zero.
F. In the arrangement of Q modules shown below, what outputs will be produced at X1-X5 and Y?
