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 almost unexplored Everglades lay close by and with a half- hour’s start a man who knew the country was safe from pursuit. As one man cheerfully confided ..., ‘A boat don’t leave no trail, stranger.’”
—For the State of Florida, U.S. public relief program (1935-1943)
“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)
“Many a time I have seen my mother leap up from the dinner table to engage the swarming flies with an improvised punkah, and heard her rejoice and give humble thanks simultaneously that Baltimore was not the sinkhole that Washington was.”
—H.L. (Henry Lewis)