Finite Automata
Print this page
First   |   Last   |   Prev   |   Next
(State) Transition diagram :

A state transition diagram or simply a transition diagram is a directed graph which can be constructed as follows:

  1. For each state in Q there is a node.
  2. There is a directed edge from node q to node p labeled a iff . (If there are several input symbols that cause a transition, the edge is labeled by the list of these symbols.)
  3. There is an arrow with no source into the start state.
  4. Accepting states are indicated by double circle.

 

First   |   Last   |   Prev   |   Next