Computer science Automata and formal languages Concept
Mealy machine
Summary
A Mealy machine is a finite-state machine that emits an output symbol on each transition, depending on the current state and the input symbol read. It turns an input word into an output word of the same length. Mealy machines model sequential circuits and controllers, where the output reacts at once to the input. They compute the same input-output functions as Moore machines, up to a shift in time, and they are a special kind of finite-state transducer.
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | BDWD5J39DJ |
|---|---|
| URI | m2://BDWD5J39DJ |
| Kind | concept |
| Writing | W0 stub |
| MSC | 68Q45 |
| Specializes | Finite-state machine |
| Same as | |
| Changed | 3 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.