Finite State Machine Output - Mealy vs. Moore

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

[@Strebezhev]

Thank you very much for your hard work doing these amazing lessons!

[@sham4895]

You're so awesome. I'm a complete beginner. Thanks a lot for the informative video.

[@andrewquinton7127]

Excellent content! thanks so much for this series.

[@Intermation]

Thanks for the feedback - I appreciate it!

[@mariacunha8508]

Cool content and explanation. But the real question now: how does he write on the board like that? Im super confused lol

[@rayamberg]

I was wondering the same thing! I'm guessing it's a glass pane and we are seeing a mirror image of the original recording.

[@victormagnani7368]

thanks!

[@diegoteceletro]

you have the Leonardo DaVinci hability

[@LOLWUT281]

Thanks for these great videos, I learn a lot!
However, I don't really like your second example, especially the mealy example. I feel like it only makes sense if you were to say that there's a end of line or end of file indicator. Then there's be a third option, pending that could go from Q1 to fail, for example.
Otherwise, what if we just had '0'? it never leaves Q1.

[@ahmadjaradat3011]

Thank you very much for your hard work doing these amazing lessons!