go to previous page   go to home page   go to next page


No, because after making the first state transition, the automaton gets stuck in state q1.

Stuck Automaton

Diagram of an automaton

Our automaton simply stops when the current character does not lead out of the current state. Later on, a computer program that implements a finite-state automata must to do something besides just stop dead.


(Thought Question: ) What control structures do programming languages have that give them more power than simple sequential execution of statements?