Moore machines

A Moore machine (Hopcroft and Ullman, 1979, 42) may be defined by a similar six-tuple, with the only difference that symbols are output after the transition to a new state is completed, and the output symbol depends only on the state just reached, that is, $\lambda:Q\rightarrow\Gamma$.

The class of translations that may be performed by Mealy machines and the class of translations that may be performed by Moore machines are identical. Indeed, given a Mealy machine, it is straightforward to construct the equivalent Moore machine and vice versa (Hopcroft and Ullman, 1979, 44) .