In the theory of discrete dynamical systems, a state space is a directed graph where each possible state of a dynamical system is represented by a vertex, and there is a directed edge from a to b if and only if ƒ(a) = b where the function f defines the dynamical system.
State spaces are useful in computer science as a simple model of machines. Formally, a state space can be defined as a tuple where:
- N is a set of states
- A is a set of arcs connecting the states
- S is a nonempty subset of N that contains start states
- G is a nonempty subset of N that contains the goal states.
A state space has some common properties:
- complexity, where branching factor is important
- structure of the space, see also graph theory:
- directionality of arcs
- tree
- rooted graph
In a computer program, when the effective state space is small compared to all reachable states, this is referred to as clumping. Software such as LURCH analyzes such situations.
State space search explores a state space.
Famous quotes containing the words state and/or space:
“The average Kentuckian may appear a bit confused in his knowledge of history, but he is firmly certain about current politics. Kentucky cannot claim first place in political importance, but it tops the list in its keen enjoyment of politics for its own sake. It takes the average Kentuckian only a matter of moments to dispose of the weather and personal helath, but he never tires of a political discussion.”
—For the State of Kentucky, U.S. public relief program (1935-1943)
“Why not a space flower? Why do we always expect metal ships?”
—W.D. Richter (b. 1945)