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:
“All oppression creates a state of war.”
—Simone De Beauvoir (1908–1986)
“There is not any present moment that is unconnected with some future one. The life of every man is a continued chain of incidents, each link of which hangs upon the former. The transition from cause to effect, from event to event, is often carried on by secret steps, which our foresight cannot divine, and our sagacity is unable to trace. Evil may at some future period bring forth good; and good may bring forth evil, both equally unexpected.”
—Joseph Addison (1672–1719)
“I am fearful that the paper system ... will ruin the state. Its demoralizing effects are already seen and spoken of everywhere ... I therefore protest against receiving any of that trash.”
—Andrew Jackson (1767–1845)