Missouri University of Science & Technology

COMP ENG 2210

1. Given the state table below with the state variables X(t) and Y(t), externally applied input b(t) and output g(t). Answer the questions below: Present Input Present State Present Next State SR Flip Flop D Flip Flop Output Inputs Input b(t) X(t) Y(t) g(t) X(t+1) Y(t+1) Jx(t) Kx(t) Dy(t) 0 0 0 0 1 1 ☐ X 0 이 1 1 0 0 Ο X Ο 0 1 이 1 1 이 X 이 O 0 1 1 이 1 X 1 0 이 0 1 0 1 ☑ Ο 1 이 1 0 이 이 X 0 1 0 1 이 1 X 1 1 1 0 1 x a. (1 point) What kind of state machine does the state table represent? M ooRE b. (4 points) Fill in the missing values for the state table. c. (5 points) Draw the state transition diagram based on the state table. 0, 00 0 이 I 0 (0 Name: 2. (15 Points) Design a sequence recognizer to recognize the sequence 0011/0110. The output must be 1 at the occurrence of the last bit in the sequence. Overlap is allowed. Draw the state transition diagram only. 이 G 00 이 A 0/0 B A 00 1/0 ช B 이 1 1 1 Name: 3. (10 points) Make an AB flip-flop (truth table shown below) out of a JK flipflop. Show all your work and draw the resulting circuit. Get minimal SOP equations for next state logic.