Formal Definition
A Mealy machine is a 6-tuple, (S, S0, Σ, Λ, T, G), consisting of the following:
- a finite set of states (S)
- a start state (also called initial state) S0 which is an element of (S)
- a finite set called the input alphabet (Σ)
- a finite set called the output alphabet (Λ)
- a transition function (T : S × Σ → S) mapping pairs of a state and an input symbol to the corresponding next state.
- an output function (G : S × Σ → Λ) mapping pairs of a state and an input symbol to the corresponding output symbol.
In some formulations, the transition and output functions are coalesced into a single function (T : S × Σ → S × Λ).
Read more about this topic: Mealy Machine
Famous quotes containing the words formal and/or definition:
“Then the justice,
In fair round belly with good capon lined,
With eyes severe and beard of formal cut,
Full of wise saws and modern instances;
And so he plays his part.”
—William Shakespeare (1564–1616)
“The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
—William James (1842–1910)