State transition diagram :
Finite Automata
Print this page
First   |   Last   |   Prev   |   Next
We can describe the same DFA by transition table or state transition diagram as following:

 

Transition Table :

 
0
1

It is easy to comprehend the transition diagram.

Explanation : We cannot reach find state w/0 or in the i/p string. There can be any no. of 0's at the beginning. ( The self-loop at on label 0 indicates it ). Similarly there can be any no. of 0's & 1's in any order at the end of the string.

First   |   Last   |   Prev   |   Next