Be able to draw and interpret simple state transition diagrams and state transition tables for FSMs with no output and with output (Mealy machines only).
A finite state machine is an abstract machine which can be in exactly one of a finite number of states at any given time.
FSMs can have outputs but this is not required. Those that do not have outputs are known as Finite State Automata (FSA).
| Name | Symbol |
|---|---|
| State |  |
| Start State |  |
| Accept / End State |  |
Transition where i is input and j is output |
 |