Theory Of Computation

Section A

Moore Machine

Moore machine is an FSM whose outputs depend on only the present state.A Moore machine can be described by a 6 tuple(Q, Σ, O, δ,X,q0)where:

• Q is a finite set of states.
• Σ is a finite set of symbols called the input alphabet.
• O is a finite set of symbols called the output alphabet.
• δ is the input transition function where δ: Q × Σ→Q
• X is the output transition function where X: Q→O
• q0 is the initial state from where any input is processed (q0∈Q).

The state table of a Moore Machine is shown below–

The state diagram of the above Moore Machine is: