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:
“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)
“Mothers often are too easily intimidated by their children’s negative reactions...When the child cries or is unhappy, the mother reads this as meaning that she is a failure. This is why it is so important for a mother to know...that the process of growing up involves by definition things that her child is not going to like. Her job is not to create a bed of roses, but to help him learn how to pick his way through the thorns.”
—Elaine Heffner (20th century)