How Does A-Level Comp Sci: Finite State Machine Work?

A Finite State Machine is like a game of Simon Says, where you only do what the current instruction tells you to do.

Imagine you are playing with a toy robot. The robot only knows three things: Idle, Listening, and Moving. These are its states.

1. When the robot is Idle, it sits still.
2. When you