Formal Definition
A Moore machine can be defined as 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 a state and the input alphabet to the next state
- an output function (G : S → Λ) mapping each state to the output alphabet
The Moore machine is a finite state transducer.
Read more about this topic: Moore Machine
Famous quotes containing the words formal and/or definition:
“On every formal visit a child ought to be of the party, by way of provision for discourse.”
—Jane Austen (1775–1817)
“Beauty, like all other qualities presented to human experience, is relative; and the definition of it becomes unmeaning and useless in proportion to its abstractness. To define beauty not in the most abstract, but in the most concrete terms possible, not to find a universal formula for it, but the formula which expresses most adequately this or that special manifestation of it, is the aim of the true student of aesthetics.”
—Walter Pater (1839–1894)