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:
“There must be a profound recognition that parents are the first teachers and that education begins before formal schooling and is deeply rooted in the values, traditions, and norms of family and culture.”
—Sara Lawrence Lightfoot (20th century)
“Perhaps the best definition of progress would be the continuing efforts of men and women to narrow the gap between the convenience of the powers that be and the unwritten charter.”
—Nadine Gordimer (b. 1923)