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.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 12 December 2005.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "state machine", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 12 December 2005. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/statemachine.html