Guajara in other languages: Spanish, Deutsch, French, Italian ...



Moore machine

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.

The name Moore machine comes from that of their promoter: E. F. Moore, a state machine pioneer, who wrote Gedanken-experiments on Sequential Machines, pp 129 – 153, Automata Studies, Annals of Mathematical Studies, no. 34, Princeton University Press, Princeton, N. J., 1956

This article is a stub. You can help Wikipedia by fixing it.





Wikipedia - All text is available under the terms of the GNU Free Documentation License.

Tagoror dot com  -  Legal Information  -  Contact us