In theoretical computer science, a state transition system is an abstract machine used in the study of computation. The machine consists of a set of states and transitions between states, which may be labeled with labels chosen from a set; the same label may appear on more than one transition. If the label set is a singleton, the system is essentially unlabeled, and a simpler definition that omits the labels is possible.
State transition systems coincide mathematically with abstract rewriting systems (as explained further in this article). State transition systems differ however from finite state automata in several ways:
- In a state transition system the set of states is not necessarily finite, or even countable.
- In a state transition system the set of transitions is not necessarily finite, or even countable.
- A finite-state automaton distinguishes a special "start" state and a set of special "final" states.
State transition systems can be represented as directed graphs.
Read more about State Transition System: Formal Definition, Relation Between Labelled and Unlabelled Transition Systems., Comparison With Abstract Rewriting Systems, Extensions
Famous quotes containing the words state, transition and/or system:
“A state is not a state if it belongs to one man.”
—Sophocles (497–406/5 B.C.)
“Some of the taverns on this road, which were particularly dirty, were plainly in a transition state from the camp to the house.”
—Henry David Thoreau (1817–1862)
“Psychoanalysis is an attempt to examine a person’s self-justifications. Hence it can be undertaken only with the patient’s cooperation and can succeed only when the patient has something to gain by abandoning or modifying his system of self-justification.”
—Thomas Szasz (b. 1920)