Jump to content

State (computer science)

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Grendelkhan (talk | contribs) at 20:23, 31 July 2003 (Basic summary, might be too dictionary-like, despite my efforts.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

A state is a concept in automata theory which occasionally extends into some forms of systems programming such as lexers and |parsers.

Whether the automaton in question is a Finite state machine, a pushdown automaton or a full-fledged Turing machine, a state is a particular set of instructions which will be executed in response to the machine's input. The state can be thought of as analogous to a practical computer's main memory. the behavior of the system is a function of (a) the definition of the automaton, (b) the input, and (c) the current state.