Science  People  Locations  Timeline
Index: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z

Home > State (computer science)


In information processing, a state is the complete set of properties (for example, its energy level, etc. see state (physics)) transmitted by an object to an observer via one or more channels. Any change in the nature or quantity of such properties in a state is detected by an observer and thus a transmission of information occurs.

In computer science, 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 automatonIn computer science, in particular automata theory, pushdown automata (PDA) are abstract devices that recognize context-free languages. Informally, a pushdown automaton is a finite automaton outfitted with access to a potentially unlimited amount of memor or a full-fledged Turing machineThe Turing machine is an abstract model of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of algorithm or 'mechanical procedure'. As such it is still widely used in theoretical computer science, 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.

See Also



Read more »

Non User