Mealy finite state machines typically have fewer states than the corresponding Moore machine, but this comes at a cost. They are more difficult to design. In this video, we convert two different Moore machines to Mealy machines and perform the necessary simplifications.

Timestamps
00:00 | Intro
00:32 | Intro to 1st Moore machine example - (H v T)*TT
02:01 | Moore machine transition table for (H v T)*TT
03:22 | Converting (H v T)*TT Moore machine to Mealy using transition table
05:11 | Minimizing the unsimplified (H v T)*TT Mealy machine
09:11 | State diagram from transition table of simplified (H v T)*TT Mealy machine
10:12 | Intro to 2nd Moore machine example - ""0101"" pattern detector
14:24 | Moore machine transition table for ""0101"" pattern detection
17:01 | Converting ""0101"" pattern detection Moore machine to Mealy using transition table
17:59 | Minimizing the unsimplified ""0101"" pattern detection Mealy machine
25:49 | State diagram from transition table of ""0101"" pattern detection Mealy machine

Hashtags
#moore #mealy #fsm