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:
“Chippenhook was the home of Judge Theophilus Harrington, known for his trenchant reply to an irate slave-owner in a runaway slave case. Judge Harrington declared that the owner’s claim to the slave was defective. The owner indignantly demanded to know what was lacking in his legally sound claim. The Judge exploded, ‘A bill of sale, sir, from God Almighty!’”
—For the State of Vermont, U.S. public relief program (1935-1943)
“The most remarkable aspect of the transition we are living through is not so much the passage from want to affluence as the passage from labor to leisure.... Leisure contains the future, it is the new horizon.... The prospect then is one of unremitting labor to bequeath to future generations a chance of founding a society of leisure that will overcome the demands and compulsions of productive labor so that time may be devoted to creative activities or simply to pleasure and happiness.”
—Henri Lefebvre (b. 1901)
“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.