Moore machine

In the theory of computation, a Moore machine is a finite-state machine whose output values are determined solely by its current state. This is in contrast to a Mealy machine, whose output values are determined both by its current state and by the values of its inputs. The Moore machine is named after Edward F. Moore, who presented the concept in a 1956 paper, “Gedanken-experiments on Sequential Machines.”

A Moore machine can be defined as a 6-tuple ${\displaystyle (S,S_{0},\Sigma ,\Lambda ,T,G)}$ consisting of the following:

A Moore machine can be regarded as a restricted type of finite-state transducer.

State transition table is a table showing relation between an input and a state.

The state diagram for a Moore machine or Moore diagram is a diagram that associates an output value with each state. Moore machine is an output producer.

As Moore and Mealy machines are both types of finite-state machines, they are equally expressive: either type can be used to parse a regular language.

The difference between Moore machines and Mealy machines is that in the latter, the output of a transition is determined by the combination of current state and current input (${\displaystyle S\times \Sigma }$ as the input to ${\displaystyle G}$), as opposed to just the current state (${\displaystyle S}$ as the input to ${\displaystyle G}$). When represented as a state diagram,

...
Wikipedia