Moore Machine - Formal Definition

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:

    True variety is in that plenitude of real and unexpected elements, in the branch charged with blue flowers thrusting itself, against all expectations, from the springtime hedge which seems already too full, while the purely formal imitation of variety ... is but void and uniformity, that is, that which is most opposed to variety....
    Marcel Proust (1871–1922)

    ... we all know the wag’s definition of a philanthropist: a man whose charity increases directly as the square of the distance.
    George Eliot [Mary Ann (or Marian)