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:
“It is said that he once had a sore toe that so annoyed him that he went to the woodpile and chopped it off with an axe, quoting the Scripture, ‘If thy foot offend thee, cut it off.’”
—For the State of Rhode Island, U.S. public relief program (1935-1943)
“The woman’s world ... is shown as a series of limited spaces, with the woman struggling to get free of them. The struggle is what the film is about; what is struggled against is the limited space itself. Consequently, to make its point, the film has to deny itself and suggest it was the struggle that was wrong, not the space.”
—Jeanine Basinger (b. 1936)