Mealy machine¶

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.

Version: v1 · 2026-09-28 · History
Domain-specific #: 10627
Domain group: Applied Sciences & Engineering
Origin domain: Computer Science & Software Engineering
Subdomain: Automata Theory → Computer Science & Software Engineering

Core Idea¶

Mealy machine is treated here as the recurring automata theory identity summarized by this source-grounded definition: 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. 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.

Scope of Application¶

History. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".
Formal definition. a transition function T : S \times \Sigma \rightarrow S mapping pairs of a state and an input symbol to the corresponding next state.
Formal definition. an output function G : S \times \Sigma \rightarrow \Lambda^ mapping pairs of a state and an input symbol to the corresponding output symbol.
Formal definition. In some formulations, the transition and output functions are coalesced into a single function T : S \times \Sigma \rightarrow S \times \Lambda^ .
Applications. However, although a Mealy model could be used to describe the Enigma, the state diagram would be too complex to provide feasible means of designing complex ciphering machines.

Clarity¶

A clear use of Mealy machine names the carrier, the operative relation, and the conditions under which the source treats the identity as present. The minimal definition is 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.

Manages Complexity¶

Mealy machine compresses multiple automata theory details into a stable diagnostic relation. The source shows both the central mechanism—for example, a traffic light is a system that consists of multiple subsystems, such as the different traffic lights, that work concurrently.—and the practical consequence—mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits".

Abstract Reasoning¶

Type the carrier. Identify the automata theory entities to which the claim applies.
State the relation. Use the source-grounded identity: 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.
Check operation and conditions. "Evolution across time" is realized in this abstraction by having the state machine consult the time-changing input symbol at discrete "timer ticks" t0, t1, t2, ... and react according to its internal configuration at those idealized.

Knowledge Transfer¶

Within the home domain. Knowledge about Mealy machine transfers literally when a new case preserves the same carrier type, relation, and recognition test. Mealy, who presented the concept in a 1955 paper, "A Method for Synthesizing Sequential Circuits". a transition function T : S \times \Sigma \rightarrow S mapping pairs of a state and an input symbol to the corresponding next state. Beyond the home domain. No canonical parent is asserted for Mealy machine.

Relationships to Other Abstractions¶

Current abstraction Mealy machine Domain-specific

Parents (1) — more general patterns this builds on

Mealy machine is a kind of Abstract Machine Domain-specific

Mealy machine is a strict kind of Abstract Machine: its frozen identity entails the parent's defining structure while adding domain-specific restrictions.

Hierarchy paths (2) — routes to 2 parentless roots

Mealy machine → Abstract Machine → Formal System → Formalization → Representation → Abstraction

Show alternative path (1)

Neighborhood in Abstraction Space¶

Mealy machine sits in a moderately populated region (41^st percentile for distinctiveness): it has near-neighbors but no dense thicket of look-alikes.

Family — Computation Models & Complexity Classes (37 abstractions)

Nearest neighbors

Computed from structural-signature embeddings · 2026-10-08