finite-state machine
finite-state machine noun: 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.
Noun
finite-state machine (plural finite-state machines)
- 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
Synonyms of finite-state machine
Forms of finite-state machine
| plural | finite-state machines |
|---|---|
| alternative initialism | FSM |
Questions about finite-state machine
- What does finite-state machine mean?
- Finite-state machine means 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.
- What part of speech is finite-state machine?
- Finite-state machine is a noun.
- What is the plural of finite-state machine?
- The plural of finite-state machine is finite-state machines.
Words near finite-state machine in the dictionary
Source and license
Adapted from Wiktionary: finite-state machine (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “finite-state machine.” Word.ws, https://word.ws/finite-state_machine. Based on Wiktionary, CC BY-SA 4.0.
