State transition table

In automata theory and sequential logic is meant by a ( state ) transition table is a table that lists the sequelae of an automaton as a function of its input states and input. Thus provide transition tables an alternative to the state transition diagrams dar.

Usual modes of representation

One-dimensional state tables

One-dimensional state tables list the inputs on the left, outputs on the right. Here is a simple example of a state machine with two states and two inputs: