finite-state machine

English

Alternative forms

FSM (initialism)

Noun

finite-state machine (plural finite-state machines)

(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

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.