\ /
                           __V__
               a          /     \             a
        +---------------->|  1  |<-------------------+
        |                /\_____/\                   |
        |                |       |                   |          
 b--+   |                |       |                   |          
 |  | __|__            _/        \__               __|__        
 |  \/     \    b     /             \  a          //   \\       
 +-->|  2  |<---------       b       ------------>|| 3 ||       
     \_____/<-------------------------------------\\___//       

In this FSA, state 1 is the initial state (indicated by the large V at
the top) and state 3 is the final state (indicated by the double-circle).
Suppose we present the string "bbaa" to the FSA.  The first character, 
'b', takes us from the initial state (1) to state 2.  The second 
character, another 'b', takes us from state 2 back to state 2 again.  
The third character, this time an 'a', takes us from state 2 to state 1.  
From state 1, the final 'a' takes us to the final state, state 3.
Since there are no more characters and we are in the final state, 
the string "bbaa" is accepted.

Click on BACK or hit the back arrow to get back to the previous page.