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:
“When I think of a merry, happy, free young girl—and look at the ailing, aching state a young wife generally is doomed to—which you can’t deny is the penalty of marriage.”
—Victoria (1819–1901)
“from above, thin squeaks of radio static,
The captured fume of space foams in our ears—”
—Hart Crane (1899–1932)