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:
“That anger can be expressed through words and non-destructive activities; that promises are intended to be kept; that cleanliness and good eating habits are aspects of self-esteem; that compassion is an attribute to be prized—all these lessons are ones children can learn far more readily through the living example of their parents than they ever can through formal instruction.”
—Fred Rogers (20th century)
“The physicians say, they are not materialists; but they are:MSpirit is matter reduced to an extreme thinness: O so thin!—But the definition of spiritual should be, that which is its own evidence. What notions do they attach to love! what to religion! One would not willingly pronounce these words in their hearing, and give them the occasion to profane them.”
—Ralph Waldo Emerson (1803–1882)