Moore machine

In the theory of computation, a Moore machine is a finite state automaton where the outputs are determined by the current state alone. The state diagram for a Moore machine will include an output signal for each state.\nCompare 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

Formal Definition

A Moore machine can be defined an n-tuple\n{ Q, Σ, Δ, δ, λ, } consisting of
\n* a finite set of states ( Q )\n* a finite set called the input alphabet ( Σ )\n* a finite set called the output alphabet ( Δ )\n* a transition function (δ : Q x Σ → Q ) mapping a state and an input to the next state\n* an output function ( λ : Q → Δ ) mapping each state to the output alphabet.\n* a start state The number of states in a Moore machine will be greater than or equal to the number of states in the corresponding Mealy machine. Category:Computational models