Mealy and Moore machines: Solving a design problem from A to Z - "101 Sequence detector"
In this video I teach you the difference between the procedure of a Mealy machine and that of a Moore machine. I use the sequence detector problem as an a example to illustrate this procedure. I solve first using the Moore procedure then re-solve the same problem using the Mealy procedure.
In a 101 sequence detector problem, you have an infinite stream of bits, and it is required to implement a machine that takes these bits and outputs a 1 when the machine detects the sequence 101.