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:
“A ship is a bit of terra firma cut off from the main; it is a state in itself; and the captain is its king.”
—Herman Melville (1819–1891)
“The true gardener then brushes over the ground with slow and gentle hand, to liberate a space for breath round some favourite; but he is not thinking about destruction except incidentally. It is only the amateur like myself who becomes obsessed and rejoices with a sadistic pleasure in weeds that are big and bad enough to pull, and at last, almost forgetting the flowers altogether, turns into a Reformer.”
—Freya Stark (1893–1993)