State-transition table
Table in automata theory and sequential logic / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about State transition table?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
"State transition" redirects here. Not to be confused with State-transition matrix or phase transition.
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-state machine will move to, based on the current state and other inputs. It is essentially a truth table in which the inputs include the current state along with other inputs, and the outputs include the next state along with other outputs.
A state-transition table is one of many ways to specify a finite-state machine. Other ways include a state diagram.