Definition
In automata theory and sequential logic, a state-transition table is a table showing what state 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.
Related concepts
Adjacency listAdjacency matrixAssociative entityAutomata theoryDataflowDecision tableExcitation tableFinite-state machineIndex notationMarkov ChainsMealy machineMoore machineNondeterministic finite automatonNondeterministic programmingPhase transitionSequential logicState-transition matrixState diagramTruth tableWard-Mellor methodology
4 concepts already in your glossary