Concepts

Finite State Machine

Model

Citation Formats

General Reference

Computing Atlas. "Finite State Machine." Accessed August 30, 2026. https://dev-computing.interactiveatlas.org/concepts/finite-state-machine.

APA Style

Computing Atlas. (n.d.). Finite State Machine. Retrieved August 30, 2026, from https://dev-computing.interactiveatlas.org/concepts/finite-state-machine

BibTeX

@misc{computingatlas-finite-state-machine,
  author = {Computing Atlas},
  title = {Finite State Machine},
  year = {2026},
  url = {https://dev-computing.interactiveatlas.org/concepts/finite-state-machine},
  note = {Accessed August 30, 2026}
}

A mathematical model of computation consisting of a finite number of states, one of which is active at any time, with transitions between states driven by input. The formalism traces to Warren McCulloch and Walter Pitts's 1943 paper on a logical calculus of neural activity, whose refinement and generalization led to the modern notion of finite automata within the theory of computation.

Facts

Disputed

Origin Year

1943 1

McCulloch and Pitts's 1943 neural-network paper is the formalism's traced ancestor, but the finite-state-machine article itself carries no dedicated history section fixing a single founding year for the model as later formalized in automata theory.

Core Principle

A system is always in exactly one of a finite set of states, and moves between states only in response to input, so its entire future behavior is determined by its current state and what it reads next. 1

Cross-Tradition Connections