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:
“The almost unexplored Everglades lay close by and with a half- hour’s start a man who knew the country was safe from pursuit. As one man cheerfully confided ..., ‘A boat don’t leave no trail, stranger.’”
—For the State of Florida, U.S. public relief program (1935-1943)
“In bourgeois society, the French and the industrial revolution transformed the authorization of political space. The political revolution put an end to the formalized hierarchy of the ancien regimé.... Concurrently, the industrial revolution subverted the social hierarchy upon which the old political space was based. It transformed the experience of society from one of vertical hierarchy to one of horizontal class stratification.”
—Donald M. Lowe, U.S. historian, educator. History of Bourgeois Perception, ch. 4, University of Chicago Press (1982)