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

formalism for describing computation

• Finnish: tilakone
• French: automate fini (fr) m
• German: endlicher Automat m, Zustandsautomat m, Zustandsmaschine f
• Romanian: automat finit n

Further reading

• finite-state machine on Wikipedia.Wikipedia