Finite State Machines (FSM)
Finite State Machines is a model of computation that can be used to model the behavior of a system. Example Here is an example of a simple state machine: This state machine models a button state machine that controls the power to some other system. A state is represented as a circle, in this example: "Power On" and "Power Off". A transition is represented by an arrow leading from one state to another: "Button click". Let us do a quick run through of what this represents. We imagine that this state machine is controlling the lights in your room. You enter the room, and it is dark. This means that you are currently in the state "Power Off". You want to turn on the lights, and in order to that you click the button that turns the light on. This is taking the transition from "Power Off" --> "Power On" through the "event" Button Click. How does this Apply to Computer Science? I first learned th...