Question

Hi

Please show steps with clean handwriting.  

2)

(10 points) A moore FSM has a single infinitely long binary string r as input and a single

output. The output is a logic 1 if there are two consecutive 1s or two consecutive 0s received.

For example,

input = 0 1 1 0 0 0 1

output = 0 0 1 0 1 1 0

Design the FSM. Use full encoding. Construct a timing diagram for the input sequence

shown above. Be sure and do an implication table check

3)

(5 points) Show the schematic of a one-hot encoded FSM that implements problem

Answer 1

15じ 5a 0 1. State Table 50 o 1 S1 0 Sa0 Sa 1 63 0 S3 1 90 93 1 S0 93 1 S2 →10 o I 0 o 0 0

011-о 0 rc cIK CIK one ho endinCoe filRy lq tos one State) D6 Da 90 52 03