1. Lab. on Finite State Machine
Sequence Recognizer

2. Homework #3 Output Z=1 when 1101 is recognized
Design a circuit to recognize the sequence 1101 in a input sequence
Output Z=1 when 1101 is recognized
Thus, the sequential machine must remember that the first two one's have occurred as it receives another symbol.
Also, the sequence contains 1101 as both an initial subsequence and a final subsequence with some overlap, i. e., or
The sequence 1101 must be recognized each time it occurs in the input sequence.

3. State Diagram (Moore model)
B/0
C/0
D/0
E/1 1
Use:
JK F.F.
binary coding for the states
“don’t care” for unused states

4. Simulation Feed a sequence containing 1101 into the designed circuit
Show the output and states of the circuit