1.Previous
3.Next

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 S₁ (the first row) and receives an input of 1 (second column), the machine will stay in the state S₁. Now if the machine is in the state S₁ and receives an input of 0 (first column), the machine will transition to the state S₂.
In the state diagram, the former is denoted by the arrow looping from S₁ to S₁ labeled with a 1, and the latter is denoted by the arrow from S₁ to S₂ labeled with a 0. This process can be described statistically using Markov Chains.

1.Previous
3.Next