Problem 2 Describe Finite State Machine One Input X One Output Z Fsm Asserts Output Z Reco Q37143605

Problem 2) Describe a finite state machine with one input X and one output Z. The FSM asserts its output Z when it recognizes the following input bit sequence: “1011” As an example, the input string X “.1011011… will cause the output to go high twice: Z- ..0001001..” Create a state diagram and assume Moore Machine FSM Call the states SO(initial

OR

 

OR