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.

A state-transition table is one of many ways to specify a finite-state machine. Other ways include a state diagram.

One-dimension
State-transition tables are sometimes one-dimensional tables, also called characteristic tables. They are much more like truth tables than their two-dimensional form. The single dimension indicates inputs, current states, next states and (optionally) outputs associated with the state transitions.


 * {| class="wikitable" style="text-align: center;"

! Input !! Current state !! Next state !! Output
 * + State-transition table (S: state, I: input, O: output)
 * I1 || S1 || Si || Ox
 * I2 || S1 || Sj || Oy
 * In || S1 || Sk || Oz
 * I1 || S2 || Si′ || Ox′
 * I2 || S2 || Sj′ || Oy′
 * In || S2 || Sk′ || Oz′
 * I1 || Sm || Si″ || Ox″
 * I2 || Sm || Sj″ || Oy″
 * In || Sm || Sk″ || Oz″
 * }
 * I2 || S2 || Sj′ || Oy′
 * In || S2 || Sk′ || Oz′
 * I1 || Sm || Si″ || Ox″
 * I2 || Sm || Sj″ || Oy″
 * In || Sm || Sk″ || Oz″
 * }
 * I1 || Sm || Si″ || Ox″
 * I2 || Sm || Sj″ || Oy″
 * In || Sm || Sk″ || Oz″
 * }
 * I2 || Sm || Sj″ || Oy″
 * In || Sm || Sk″ || Oz″
 * }
 * In || Sm || Sk″ || Oz″
 * }
 * In || Sm || Sk″ || Oz″
 * }

Two-dimensions
State-transition tables are typically two-dimensional tables. There are two common ways for arranging them.

In the first way, one of the dimensions indicates current states, while the other indicates inputs. The row/column intersections indicate next states and (optionally) outputs associated with the state transitions.


 * {| class="wikitable" style="text-align: center;"

! !! I1 !! I2 !! … !! In ! S1 ! S2 ! … ! Sm
 * + State-transition table (S: state, I: input, O: output)
 * Si/Ox || Sj/Oy || … || Sk/Oz
 * Si′/Ox′ || Sj′/Oy′ || … || Sk′/Oz′
 * Si″/Ox″ || Sj″/Oz″ || … || Sk″/Oz″
 * }

In the second way, one of the dimensions indicates current states, while the other indicates next states. The row/column intersections indicate inputs and (optionally) outputs associated with the state transitions.


 * {| class="wikitable" style="text-align: center;"

! !! S1 !! S2 !! … !! Sm ! S1 ! S2 ! … ! Sm
 * + State-transition table (S: state, I: input, O: output, —: illegal)
 * Ii/Ox || — || … || —
 * — || — || … || Ij/Oy
 * — || Ik/Oz || … || —
 * }

Other forms
Simultaneous transitions in multiple finite-state machines can be shown in what is effectively an n-dimensional state-transition table in which pairs of rows map (sets of) current states to next states. This is an alternative to representing communication between separate, interdependent finite-state machines.

At the other extreme, separate tables have been used for each of the transitions within a single finite-state machine: "AND/OR tables" are similar to incomplete decision tables in which the decision for the rules which are present is implicitly the activation of the associated transition.

Example
An example of a state-transition table together with the corresponding state diagram for a finite-state machine is given below:


 * {| class="wikitable" style="text-align: center; display: inline-table; vertical-align:top;"

! ! 0 !! 1 ! S1 ! S2
 * + State-transition table
 * S2 || S1
 * S1 || S2
 * }

In the state-transition table, all possible inputs to the finite-state machine are enumerated across the columns of the table, while all possible states are enumerated across the rows. If the machine is in the state S1 (the first row) and receives an input of 1 (second column), the machine will stay in the state S1. Now if the machine is in the state S1 and receives an input of 0 (first column), the machine will transition to the state S2. In the state diagram, the former is denoted by the arrow looping from S1 to S1 labeled with a 1, and the latter is denoted by the arrow from S1 to S2 labeled with a 0. This process can be described statistically using Markov Chains.

For a nondeterministic finite-state machine, an input may cause the machine to be in more than one state, hence its non-determinism. This is denoted in a state-transition table by the set of all target states enclosed in a pair of braces {}. An example of a state-transition table together with the corresponding state diagram for a nondeterministic finite-state machine is given below:


 * {| class="wikitable" style="text-align: center; display: inline-table; vertical-align:top;"

! ! 0 !! 1 ! S1 ! S2
 * + State-transition table
 * S2 || S1
 * {S1, S2} || S2
 * }

If the machine is in the state S2 and receives an input of 0, the machine will be in two states at the same time, the states S1 and S2.

Transformations from/to state diagram
It is possible to draw a state diagram from a state-transition table. A sequence of easy to follow steps is given below:
 * 1) Draw the circles to represent the states given.
 * 2) For each of the states, scan across the corresponding row and draw an arrow to the destination state(s). There can be multiple arrows for an input character if the finite-state machine is nondeterministic.
 * 3) Designate a state as the start state. The start state is given in the formal definition of a finite-state machine.
 * 4) Designate one or more states as accepting state. This is also given in the formal definition of a finite-state machine.