A finite state machine in which the outputs of the machine are associated with the transitions. See: Moore machines.

In the theory of computation, a Mealy machine is finite state machine (and more accurately, a finite state transducer) that generates an output based on its current state and an input. This means that the state diagram will include both an input and output signal for each transition edge. In contrast, the output of a Moore finite state machine depends only on the machine's current state, transitions having no input attached.