← ProblemsCircuits / Sequential Logic / Finite State Machines
FSM 3: combinational logic only
15%fsmconditionalsA Moore machine has four states A, B, C, D, one input in, and one output out, with this state transition table:
| Current state | next state when in = 0 | next state when in = 1 | output out |
|---|---|---|---|
| A | A | B | 0 |
| B | C | B | 0 |
| C | A | D | 0 |
| D | C | B | 1 |
In this exercise, implement only the combinational logic for this machine — there is no clock and no state register. Given the current state on the 2-bit input state, produce the 2-bit next_state and the output out.
Use the state encoding A = 2'b00, B = 2'b01, C = 2'b10, D = 2'b11.