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:
“And now the end is near
And so I face the final curtain,
I’ll state my case of which I’m certain.
I’ve lived a life that’s full, I traveled each and ev’ry highway,
And more, much more than this. I did it my way.”
—Frank Sinatra (b. 1915)
“Power ceases in the instant of repose; it resides in the moment of transition from a past to a new state, in the shooting of the gulf, in the darting to an aim.”
—Ralph Waldo Emerson (1803–1882)
“Thou preparest a table before me in the presence of mine enemies; thou anointest my head with oil; my cup runneth over.”
—Bible: Hebrew Psalms, 23:5.