Finite State Machines

In this lesson:

• what an FSM is: finite states, transitions on events, one state at a time
• why it's the natural fit for byte-at-a-time protocol parsing
• two implementations: switch-on-state and a transition table
• Moore vs Mealy (where outputs happen)
• the gotchas: unhandled transitions, error recovery, state explosion