Електронний багатомовний

термінологічний словник

Electronic Multilingual Terminological Dictionary


Information technology

Finite State Machine

It is an abstract machine that can be in exactly one of a finite number of states at any given time .

The machine can change from one state to another in response to some inputs; the change from one state to another is called a transition .

Sources:

Sakarovitch Jacques Elements of automata theory. Translated from the French by Reuben Thomas. Cambridge University Press, 2009. – 782

Part of speech Noun
Countable/uncountable countable
Type singular, countable, abstract, сommon, inanimate
Gender neutral
Case nominative