A state transition table is a truth table that shows the output and next state for a synchronous sequential network, for a given input and current state. For example, a state transition table for a simple, two-bit counter with a "count enable" (EN) input might look like:
Inputs | Current State | Next State | Outputs 
  EN   |      Q1 Q0    |    D1 D0   |  Q1 Q0
-------+---------------+------------+---------
   0   |      0  0     |    0  0    |   0  0
   0   |      0  1     |    0  1    |   0  1
   0   |      1  0     |    1  0    |   1  0
   0   |      1  1     |    1  1    |   1  1
   1   |      0  0     |    0  1    |   0  0
   1   |      0  1     |    1  0    |   0  1
   1   |      1  0     |    1  1    |   1  0
   1   |      1  1     |    0  0    |   1  1

See also state optimization, state minimization, one-hot encoding, Moore machine, Mealy machine, finite state machine, D Flip-Flop, state transition diagram.

Log in or registerto write something here or to contact authors.