In the automata theory of computer science, a Moore machine is a finite state automaton that maps states in the machine to outputs.
A Moore machine can be defined as follows:
Compare with a Mealy machine, which maps transitions in the machine to outputs.
This article is a stub. You can help Wikipedia by fixing it.