Question

Do a finite state machine that detects the sequence 101 on serial one-bit input x. One-bit output Z is 0 unless the 101 has been detected. Z should be one in any case in which the previous 3 inputs are 101, including overlapping cases. Reset = 1 should take the finite state machine back to the initial state. This is a block diagram of a generic FSM. Assume a Moore Model (Remember in a Moore model, states alone combinatorially determine output Z). If it takes 4 states to make this machine, then n = 2. And if you do {Q, x} m = 3. What to do: A) Draw a state diagram for this machine. B) Create a state assignment table for your state machine. C) Create a state transition table for your state machine. D) Find the logic to get Z from the state Q.

          Do a finite state machine that detects the sequence 101 on serial one-bit input x. One-bit output Z is 0 unless the 101 has been detected. Z should be one in any case in which the previous 3 inputs are 101, including overlapping cases. Reset = 1 should take the finite state machine back to the initial state. This is a block diagram of a generic FSM. Assume a Moore Model (Remember in a Moore model, states alone combinatorially determine output Z). If it takes 4 states to make this machine, then n = 2. And if you do {Q, x} m = 3.

What to do:
A) Draw a state diagram for this machine.
B) Create a state assignment table for your state machine.
C) Create a state transition table for your state machine.
D) Find the logic to get Z from the state Q.

Added by Brian O.

Question

Please give Ace some feedback