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:
“If kangaroos had no tails, they would topple over seems to me to mean something like this: in any possible state of affairs in which kangaroos have no tails, and which resembles our actual state of affairs as much as kangaroos having no tails permits it to, the kangaroos topple over.”
—David Lewis (b. 1941)
“A transition from an author’s books to his conversation, is too often like an entrance into a large city, after a distant prospect. Remotely, we see nothing but spires of temples, and turrets of palaces, and imagine it the residence of splendor, grandeur, and magnificence; but, when we have passed the gates, we find it perplexed with narrow passages, disgraced with despicable cottages, embarrassed with obstructions, and clouded with smoke.”
—Samuel Johnson (1709–1784)
“For who is greater, the one who is at the table or the one who serves? Is it not the one at the table? But I am among you as one who serves.”
—Bible: New Testament, Luke 22:27.