A Moore machine produces an output for each state. An FSA is thus a Moore machine with two outputs, success and failure, corresponding to final and nonfinal states respectively. A Mealy machine produces an output for each transition (state/input pair). A Moore machine can be transformed into an equivalent Mealy machine by associating the output of each state with every transition that leads to that state. The languages accepted are the same (although the Mealy machine doesn't recognize the empty word).
Finite State Machines with Output (Mealy and Moore Machines)
Articles which converts an FSA to equivalent Moore and Mealy machines and discusses their equivalence.
Implementing Mealy and Moore Machines
This site has an example of conversion of a FSA to equivalent Moore and Mealy machines.
Wikipedia article on Mealy machines, which are simple transducers.
Wikipedia article on Moore machines which are FSA with output determined by current state alone.
Sequential Log Implementation
A set of slides comparing Moore and Mealy machines and showing how they are used in designing the logic for vending machines and traffic light controllers.
Specification of Sequential Systems
The application of Moore and Mealy machines in the design of synchronous sequential systems.
Last update:January 2, 2007 at 19:58:46 UTC