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:
“To place liberty in an indifferency, antecedent to the thought and judgment of the understanding, seems to me to place liberty in a state of darkness, wherein we can neither see nor say any thing of it.”
—John Locke (1632–1704)
“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)
“Remember thee?
Ay, thou poor ghost, whiles memory holds a seat
In this distracted globe. Remember thee?
Yea, from the table of my memory
I’ll wipe away all trivial fond records,
All saws of books, all forms, all pressures past
That youth and observation copied there,
And thy commandment all alone shall live
Within the book and volume of my brain,”
—William Shakespeare (1564–1616)