(definition)
Definition: A model of computation consisting of a (possibly infinite) set of states, a set of start states, an input alphabet, and a transition function which maps input symbols and current states to a next state. Usually understood to be a finite state machine.
Generalization (I am a kind of ...)
model of computation.
Specialization (... is a kind of me.)
finite state machine.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Mon Dec 12 09:12:06 2005.
HTML page formatted Mon Dec 12 09:22:06 2005.
Cite this as:
Paul E. Black, "state machine", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/statemachine.html
