The two cases above make the finite automaton described non-deterministic. In state S 3, the NFA may move to S 1 without consuming an input character. This special character allows the NFA to move to a different state when given no input. The last column defines the legal transition of states of the special character, ε. Here, a nondeterministic machine in the state S 1 reading an input of 0 will cause it to be in two states at the same time, the states S 2 and S 3. The row/column intersections indicate the next state for a particular event, and (optionally) an incidental action associated with this state transition. One of the dimensions indicates current states, while the other indicates events.There are two common forms for arranging them. State transition tables are typically two-dimensional tables. S 1 and S 2 would most likely represent the single bits 0 and 1, since a single bit can only have two states.
A simple example of a state machine with two states and two combinational inputs follows: The outputs will represent the next state of the machine. Inputs are usually placed on the left, and separated from the outputs, which are on the right.
