Mealy machine
A Mealy machine is a type of digital logic finite state machine. The outputs are a function of both the current state Q and the input I. This means that the state transition diagram will include an output signal for each transition arc. For example, in going from State 1 to State 2 on input '1', the output might be '1' (this arc would be labelled 1/1). In contrast, the output of a Moore finite state machine depends only on the current state and does not depend on the current input.
The name "Mealy machine" comes from that of their promoter: G. H. Mealy, a state machine pioneer, who wrote A Method for Synthesizing Sequential Circuits, Bell System Tech. J. vol 34, pp. 1045 1079, September 1955
Referenced By
Automata Theory | Deterministic finite automata | Finite-state machine | Finite automata | Finite automaton | Finite state automata | Finite state automaton | Finite state machine | Finite state machines | List of computability and complexity topics | Moore machine | Start state | State diagram
|
