The Open Directory Project.

Directory of Mealy and Moore Machines Resources

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).

Resources in This Category

 

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