Problem 1: Given the following sequence detector:

a) What kind of finite state machine is this?

b) Using a procedure by inspection can you state which sequences does this circuit detect?

c) Develop the State Table for this circuit. Label all columns.

d) Develop the State Diagram for this circuit.

e) Propagate the following timing trace.

X         0        0       1       1      1      0      1     1       0      1      1

q1       0

q2       0

z

f) Modify the output of the circuit so that it detects the sequence 000 with overlap and also substitute the JK FlipFlops by D-FlipFlops.

Problem 2 - Implement the following logic function using one, active low enabled, 4-input multiplexer. Show procedure.

F(w, x, y, z) = ∑m(2, 3, 6, 7, 8, 11, 13, 15)

Problem 3 - a) Develop/complete the State Diagram shown below for a Moore sequence detector that detects 101 without overlap.

a) Develop the state table from the above state diagram.

Problem 4 - Given the following circuit, substitute the first two JK Flip Flops by T Flip Flops and the last JK Flip Flop by a D Flip Flop, without altering the functioning of the circuit.