Finite State Machines

This section needs expansion.
You can help by adding to it.

Definition

A finite state machine is a way of breaking down a problem into several mutually independent states that are only able to change when a transition occurs. A transition occurs when an input is given. The machine can only be in one state at a time.

A finite state machine is not a physical machine. It is an abstract representation of an algorithm, showing how something changes in response to inputs or events.

Finite State Automaton

A finite state automaton is a finite state machine which has no output. It has a start state and a set of end/accept states. If the automaton can reach an end state then the input is accepted.

Mealy Machines

A finite state machine with an output is called a Mealy Machine. It will output a value based on the input.