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:
“In a Kelton church, when a heated argument once began at morning services, a devout old deacon arose from his seat in the ‘amen corner’ and announced he was going to do for the church what the devil had never done—leave it.”
—Administration in the State of Sout, U.S. public relief program (1935-1943)
“When Paul Bunyan’s loggers roofed an Oregon bunkhouse with shakes, fog was so thick that they shingled forty feet into space before discovering they had passed the last rafter.”
—State of Oregon, U.S. public relief program (1935-1943)