Mealy Machine
Jump to navigation
Jump to search
A Mealy Machine is a finite-state machine whose output values are determined both by its current state and the current inputs.
- Context:
- It can (typically) behave such that a single input always triggers a single output.
- See: Finite-State Transducer, Moore Machine, Deterministic Automaton, State Diagram.
References
2017
- (Wikipedia, 2017) ⇒ https://en.wikipedia.org/wiki/Mealy_machine Retrieved:2017-1-27.
- In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. (This is in contrast to a Moore machine, whose output values are determined solely by its current state.)
A Mealy machine is a deterministic finite-state transducer: for each state and input, at most one transition is possible.
- In the theory of computation, a Mealy machine is a finite-state machine whose output values are determined both by its current state and the current inputs. (This is in contrast to a Moore machine, whose output values are determined solely by its current state.)