Mealy machine
Builds on Finite-state machineAlphabetString
Definition
A Mealy machine is a tuple where:
- is a finite-state machine, with finite set of states , input alphabet , transition function and initial state ;
- is an alphabet, the output alphabet;
- is the output function.
On an input string with , let for . The output of is the string .
Remarks
Example: let and with . Put for all and , , and if and otherwise, for . The state after reading a nonempty word is its last bit, so on the output is : a marks each bit equal to the bit before it. Non-example: consider a machine that writes exactly when the number of 's read so far is a perfect square. It is not a Mealy machine, because no finite set of states can store the information it needs. The output word always has the same length as the input word.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Alphabet concept
- Finite-state machine concept
- String concept
- Mealy machine definition
Further reading
About this page
| Tag | CCNRC91FJ2 |
|---|---|
| URI | m2://CCNRC91FJ2 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 68Q45 |
| Defines | Mealy machine |
| Uses | Finite-state machine, Alphabet, String |
| 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.
What links here
No page links to this page yet.