Mealy Machine

A finite automaton where the output depends on both the current state and the input symbol. Output is produced during transitions. A 6-tuple.

Suppose $M = (Q, \Sigma, \Delta, q_0, \delta, \lambda)$ is a Mealy machine, where:

• $Q$ is a finite set of states
• $\Sigma$ is a finite input alphabet
• $\Delta$ is a finite output alphabet
• $q_0 \in Q$ is the initial state
• $\delta : Q \times \Sigma \rightarrow Q$ is the transition function
• $\lambda : Q \times \Sigma \rightarrow \Delta$ is the output function

Output is attached to state + input or transitions.