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.