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:

    “Then the justice,
    In fair round belly with good capon lined,
    With eyes severe and beard of formal cut,
    Full of wise saws and modern instances;
    And so he plays his part.”
    —William Shakespeare (1564–1616)

    “Scientific method is the way to truth, but it affords, even in
    principle, no unique definition of truth. Any so-called pragmatic
    definition of truth is doomed to failure equally.”
    —Willard Van Orman Quine (b. 1908)