Moore machine¶
A finite-state transducer whose output is determined solely by its current state, while input affects output only indirectly by selecting later states.
Core Idea¶
A Moore machine is a finite-state transducer that separates transition from emission. Its transition function consumes current state and input to choose a next state, while its output function reads only the active state. A diagram therefore places output labels on nodes, not on arcs.
This separation gives outputs stable for the duration of a state and makes state the machine's complete output-relevant memory. It also creates a timing convention: an input influences output by causing a transition, and Moore–Mealy conversions may introduce an initial output or one-step shift even when the machines are otherwise expressively equivalent.
Scope of Application¶
- Digital logic. Sequential controllers decode outputs from state registers.
- Protocol control. Finite states organize stable responses to event symbols.
- Automata theory. State-output transducers support equivalence and minimization reasoning.
- Reactive modeling. Observable output traces describe stateful behavior.
Clarity¶
Declare the six-tuple, total or partial transition convention, timing of state observation, initialization output, state and transition labels, and equivalence criterion for traces. Do not infer Moore semantics merely because a diagram happens to show output text inside nodes. Inclusion test: A transducer is a Moore machine when it has finite state, deterministic state transition, and an output function G:S→Λ that ignores the current input. Exclusion test: A finite-state acceptor without an output alphabet and output function is excluded. Nearest boundary: A Mealy machine is the closest near miss because its output depends jointly on current state and input. Exit condition: The identity exits when output is placed on transitions, direct input affects immediate output, the state set is unbounded, or the transition relation is nondeterministic under the chosen definition. Common misclassifications: It is not a Mealy machine whose immediate output also depends on input. It is not a state diagram without an output function. It is not necessarily a physical clocked circuit, though such circuits commonly implement it. It is not equivalent to another transducer until initialization and output timing are aligned. Nearest named distinctions: Mealy machine: Its output function depends on current state and current input. Deterministic finite acceptor: Recognizes language membership and need not emit an output at every state. State-transition system: May omit finite alphabets, determinism, or an output mapping. Clocked sequential circuit: Is a hardware realization family rather than the abstract definition.
Manages Complexity¶
The model compresses an indefinitely long input history into finitely many equivalence classes represented by states. Assigning outputs to those states makes behavior transparent, but state minimization, timing, unreachable states, and implementation hazards remain separate questions.
Abstract Reasoning¶
- Fix finite state, input, and output alphabets.
- Choose an initial state and state-output mapping.
- Define one next state for each admissible state-input pair.
- Simulate by emitting the current state's output under the declared timing convention.
- Advance state from the input symbol.
- Compare machines by aligned input/output traces and initialization.
- Reject Mealy-style direct input-output dependence or translate it with explicit timing effects.
Knowledge Transfer¶
State-output decomposition transfers to software controllers and circuits when finite abstract state and discrete observation timing are defensible. It stops at systems requiring unbounded memory, continuous dynamics, or direct combinational input-output response unless those are abstracted separately. The cargo is output as a function of state alone.
Neighborhood in Abstraction Space¶
Moore machine sits in a crowded region of the domain-specific corpus (35th percentile for distinctiveness): several abstractions share nearly its structure, so a description that fits it tends to fit its neighbors too.
Family — Digital Logic & Finite-State Machines (10 abstractions)
Nearest neighbors
- Generalized Büchi Automaton — 0.91
- Switching circuit theory — 0.89
- Computer architecture — 0.88
- Nondeterministic Finite Automaton — 0.87
- Intersection Non-Emptiness Problem — 0.87
Computed from structural-signature embeddings · 2026-10-08