|
|
|
|
In this view of the FSM as a Markov diagram, the input string is represented at the top. The incoming arrow to the node labelled q0 indicates that q0 is the starting state. The circle around the node qhalt indicates that this is one (in this case the only one) of the final states. The letters associated with the arrows connecting two nodes or states indicate the input that must be currently read to carry out the depicted transition. The arrow points to the state or node into which the machine transitions if this move is made. In the animation, transitions are depicted by changing the relevant elements to red. White is used to indicate the current state that results after a transition has occurred. |
| Three Views of an FSM | ||
| © Charles F. Schmidt | ||