finite-state machine
Jump to navigation
Jump to search
English[edit]
Alternative forms[edit]
Noun[edit]
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[edit]
formalism for describing computation
|
Further reading[edit]
- finite-state machine on Wikipedia.Wikipedia