The name Moore machine comes from that of its promoter, Edward F. Moore, who wrote 1956 "Gedanken-experiments on Sequential Machines" (cf. [205]).

A Moore machine can be defined as

with

- := Finite set of states
- := Set of initial states
- := Set of final states
- := Finite set of symbols forming the input alphabet
- := Finite set of symbols forming the output alphabet
- := Set of state transitions
- := Set of output transitions

The number of states in a Moore machine will be greater than or equal to the number of states in the corresponding Mealy machine.

The name Mealy machine comes from that of the concept's promoter, G. H. Mealy, who wrote 1955 "A Method for Synthesizing Sequential Circuits" (cf. [197])

A Mealy machine can be defined as

with

- := Finite set of states
- := Set of initial states
- := Set of final states
- := Finite set of symbols forming the input alphabet
- := Finite set of symbols forming the output alphabet
- := Set of state transitions
- := Set of output transitions

Th: If is a mealy automaton and a moore automaton than and are equivalent (see Hopcroft and Ullman [137]:p.44).

An interesting generalization of a mealy automaton is the Finite Transducer (cf. Yu (1997)[300]:P66f):

with

- := Finite set of states
- := Set of initial states
- := Set of final states
- := Finite set of symbols forming the input alphabet
- := Finite set of symbols forming the output alphabet
- := Set of state and output transitions

A finite trasducer is called to be in a standard form if one uses a function instead of the relation and it holds:

Th: Each finite transducer can be transformed into an equivalent finite transducer in the standard form (cf. (cf. Yu (1997)[300]:P69):

Gerd Doeben-Henisch 2010-03-03