finite-state machine

English

Alternative forms

  • FSM (initialism)

Noun

finite-state machine (plural finite-state machines)

  1. (computing theory) A formalism for describing computation, consisting of a finite set of states and a transition function describing when to move from one state to another.
    Synonyms: finite-state automaton, state machine, finite automaton, automaton
    Hypernyms: transition system, pushdown automaton, Turing machine

Translations

Further reading

This article is issued from Wiktionary. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.