Over the last few episodes, we’ve discussed finite state automata theory. It's time to transition to the real world by adding output to create finite state machines, aka transducers. In this video, we discuss the two basic types: Moore and Mealy and discuss the pros and cons of each.

Timestamps
00:00 | Intro
00:23 | Quick Finite State Automata (FSA) review
01:36 | Add Output to Finite State Automata to get a Finite State Machine (FSM)
03:48 | Moore versus Mealy State Diagrams - Coin Toss FSM
10:22 | Moore versus Mealy State Transition Tables - Coin Toss FSM
13:26 | Moore versus Mealy State Diagrams - Binary RegEx FSM
20:31 | Moore and Mealy Pros and Cons

Hashtags
#moore #mealy #fsm