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:
“From this elevation, just on the skirts of the clouds, we could overlook the country, west and south, for a hundred miles. There it was, the State of Maine, which we had seen on the map, but not much like that,—immeasurable forest for the sun to shine on, the eastern stuff we hear of in Massachusetts. No clearing, no house. It did not look as if a solitary traveler had cut so much as a walking-stick there.”
—Henry David Thoreau (1817–1862)
“When I was going through my transition of being famous, I tried to ask God why was I here? what was my purpose? Surely, it wasn’t just to win three gold medals. There has to be more to this life than that.”
—Wilma Rudolph (1940–1994)
“The salt person and blasted place
I furnish with the meat of a fable;
If the dead starve, their stomachs turn to tumble
An upright man in the antipodes
Or spray-based and rock-chested sea:
Over the past table I repeat this present grace.”
—Dylan Thomas (1914–1953)