| Finite Automata (FA) are acceptors of regular languages defined by Regular Expressions; these are equivalent to Transition Graphs. A finite automaton for ab* is shown in action with an input string "abbb" . Press the START_ANIMATION button for invoking the aimation. The machine starts execution from the start state marked by the - sign. The moving arrow shows the execution path and the underlined input symbol shows the current symbol being processed.
For more on FA please