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:
“Thus we steadily worship Mammon, both school and state and church, and on the seventh day curse God with a tintamar from one end of the Union to the other.”
—Henry David Thoreau (1817–1862)
“For good teaching rests neither in accumulating a shelfful of knowledge nor in developing a repertoire of skills. In the end, good teaching lies in a willingness to attend and care for what happens in our students, ourselves, and the space between us. Good teaching is a certain kind of stance, I think. It is a stance of receptivity, of attunement, of listening.”
—Laurent A. Daloz (20th century)