In automata theory and sequential logic, a state transition table is a table showing what state (or states in the case of a nondeterministic finite automaton) a finite semiautomaton or finite state machine will move to, based on the current state and other inputs. A state table is essentially a truth table in which some of the inputs are the current state, and the outputs include the next state, along with other outputs.
A state table is one of many ways to specify a state machine, other ways being a state diagram, and a characteristic equation.
Read more about State Transition Table: Other Forms, Example, Transformations From/to State Diagram
Famous quotes containing the words state, transition and/or table:
“The state does not demand justice of its members, but thinks that it succeeds very well with the least degree of it, hardly more than rogues practice; and so do the neighborhood and the family. What is commonly called Friendship even is only a little more honor among rogues.”
—Henry David Thoreau (1817–1862)
“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)
“A man who can dominate a London dinner table can dominate the world. The future belongs to the dandy. It is the exquisites who are going to rule.”
—Oscar Wilde (1854–1900)