Home > Computers > Computer Science > Theoretical > Automata Theory > Mealy and Moore Machines
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).
http://www.cs.umd.edu/class/spring2003/cmsc311/Notes/Seq/fsm.html
Articles which converts an FSA to equivalent Moore and Mealy machines and discusses their equivalence.
http://www.cs.umd.edu/class/spring2003/cmsc311/Notes/Seq/impl.html
This site has an example of conversion of a FSA to equivalent Moore and Mealy machines.
http://en.wikipedia.org/wiki/Mealy_machine
Wikipedia article on Mealy machines, which are simple transducers.
http://en.wikipedia.org/wiki/Moore_machine
Wikipedia article on Moore machines which are FSA with output determined by current state alone.
http://inst.eecs.berkeley.edu/~cs150/fa05/Lectures/07-SeqLogicIIIx2.pdf
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.
http://www.cs.ucla.edu/Logic_Design/SLPDF/ch7.pdf#search="moore machines"
The application of Moore and Mealy machines in the design of synchronous sequential systems.
Home > Computers > Computer Science > Theoretical > Automata Theory > Mealy and Moore Machines
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us