1 10 points a moore fsm has a single infinitely long binary string r a
Question
1) (10 points) A moore FSM has a single infinitely long binary string r as inputand a single output. The output is a logic 1 if there are two consecutive 1s ortwo consecutive Os received. For example, input = 0110001 output = 0010110 Design the FSM. Use full encoding. Construct a timing diagram for the input sequence shown above. You do not need to provide a schematic; just the excitation and output equations is sufficient. Be sure and do an implication table check first.