Moore and Mealy Machine | Theory Of Computation (TOC)

Theory Of Computation | (TOC)Moore Machine

Moore machine is an FSM whose outputs depend on only the present state. A Moore machine
can be described by a 6 tuples M = (Q, Σ, Δ, 𝛿, λ, q0)

Where,
Q = finite set of states.
Σ= finite set of symbols called the input alphabet.
Δ= finite set of symbols called the output alphabet.
𝛿= input transition function where 𝛿: Q✕Σ→Q
 λ= output transition function where  λ: Q→Δ
q0= initial state from Where any input is processed (q0∈Q).

For Example:

A transition table for Moore Machine is like:

Transition Table.

Transition Diagram:

 Input To The Machine: 00110

OUTPUT From The Machine 000100 

In Mealy Machine, if input length = n, then output length = n+1.

 Theory Of Computation | Mealy Machine

A Mealy Machine is an FSM whose output depends on the present state as well as the present input. In this model, all the definition is same as Moore machine except the output mapping
function λ.

It can be described by 6 tuples M = (Q, Σ, Δ, 𝛿, λ, q0)

Where,
Q = finite set of states.
Σ= finite set of symbols called the input alphabet.
Δ= finite set of symbols called the output alphabet.
𝛿= input transition function where 𝛿: Q✕Σ→Q
 λ= output transition function where  λ: Q✕Σ→Δ
q0= initial state from where any input is processed (q0∈Q).

Transition Table:

Transition Diagram:

Related Posts:-

Automata Theory | Deterministic Finite Automata (DFA) | Transition Table | Transition Diagrams | Language of DFA | Theory Of Computation (TOC)

Non Deterministic Finite Automata | Language of NFA | Extended transition function of NFA | Theory Of Computation (TOC)

Eliminating Epsilon transition (ε-Transitions) | Conversion of Epsilon-NFA to DFA | Conversion of Epsilon-NFA to NFA | Theory Of Computation (TOC)

NFA with Epsilon-Transition (ε-NFA) | Epsilon-Closure (ε-Closure) of a state | Extended Transition Function of ε-NFA | Theory Of Computation (TOC)