Loading Icon

State transition table

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.

Metrics Summary

Total Publications
Lifetime
3,788
Prior Five Years
891
Total Citations
Lifetime
67,430
Prior Five Years
6,719
Total Scholars
Lifetime
8,232
Prior Five Years
6,634

Publications and Citation History

Publications based on Disciplines

Scholars based on Disciplines

Publications based on Fields

Scholars based on Fields

Highly Ranked Scholars™

Lifetime
Prior Five Years

Highly Cited Publications

Lifetime