Main Page | See live article | Alphabetical index 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: where are the same as for a Finite Automaton. The addition is and . maps the set of states, Q, to the output alphabet, . 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. This article is from Wikipedia. All text is available under the terms of the GNU Free Documentation License.