1
1) Derive the state diagram, the state table, and show the state assignment table for a
Finite State Machine that has one input, w, and one output, Z, and satisfies the following
conditions: The output, Z, is one (Z = 1) when the following input bit sequences were
101 or 111; otherwise, Z = 0.
[14]
Overlapping input patterns are allowed. An example of the desired behavior is
W: 0 1 0 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 1
Z: 0 0 0 0 1 0 1 1 1 0 0 0 0 0 1 0 1 1 1
W: 0 1 0 1 1 1 1 0 0 1 1 0 1 1 1
Z: 0 0 0 0 1 0 1 1 0 0 0 0 0 1 0 1 1