Finite Automaton

a

b

a

corresponding regular expression: ab*a

start state

accepting state

Example: process the string abba

Now try abbb

Finite number of states, but number of strings is not necessarily finite.

Previous slide

Next slide

Back to first slide

View graphic version