Finite State Machines (FSM)
- Each circle represents a state
- Circle with double-lines represents a terminal-successful state
- From each circle, there can only be one arrow for a given input (i.e. there cannot be two arrows labeled 0's or 1's) from a given state
- An arrow to the state itself leaves the state unchanged
- Each input transitions the state from one state (circle) to another
- When a "Dead" state is reached, the input string never reaches a terminal-successful state
- The machine terminates when there is no more input
- Binary Numbers that are divisible by 4 end in 00
