Transition table
In automaton theory and in switching mechanisms , a (state) transition table is a table that lists the subsequent states of an automaton depending on its input states and the input. Thus, transition tables represent an alternative to the state transition diagrams .
Usual modes of representation
One-dimensional state tables
One-dimensional status tables list the inputs on the left and the outputs on the right. Here is a simple example of a state machine with two states and two inputs:
| A. | B. | Current state | Next state | output |
|---|---|---|---|---|
| 0 | 0 | S 1 | S 2 | 1 |
| 0 | 0 | S 2 | S 1 | 0 |
| 0 | 1 | S 1 | S 2 | 0 |
| 0 | 1 | S 2 | S 2 | 1 |
| 1 | 0 | S 1 | S 1 | 1 |
| 1 | 0 | S 2 | S 1 | 1 |
| 1 | 1 | S 1 | S 1 | 1 |
| 1 | 1 | S 2 | S 2 | 0 |
literature
- Michael Sipser: Introduction to the Theory of Computation . PWS Publishing Co., Boston 1997, ISBN 0-534-94728-X