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:
“He was discontented and wasted his life into the bargain; and yet he rated it as a gain in coming to America, that here you could get tea, and coffee, and meat every day. But the only true America is that country where you are at liberty to pursue such a mode of life as may enable you to do without these, and where the state does not endeavor to compel you to sustain slavery and war and other superfluous expenses which directly or indirectly result from the use of such things.”
—Henry David Thoreau (1817–1862)
“The merit of those who fill a space in the world’s history, who are borne forward, as it were, by the weight of thousands whom they lead, shed a perfume less sweet than do the sacrifices of private virtue.”
—Ralph Waldo Emerson (1803–1882)