5. Analyzing FSM

Below is an implementation for a finite state machine, with X as input, and M as the output. We will try to understand what the system is doing by analyzing the circuit.

1. Derive Boolean expressions for next states S₁⁺, S₂⁺, and output M (based on S₁, S₂ and input X).

2. Write down the next state table,

3. then draw the finite state machine diagram (that is, draw the state transition diagram).

4. What sequence of inputs will generate output M=1? Give example inputs sequence and the corresponding output sequence.