3.1 Finite Automata
Consider the following automaton and answer the questions below.
Write down the state transition relation in a table. Decide which kind of automaton it is and justify your decision.
Fig. 3.1 a) Automaton
Decide which of the following words are accepted by the automaton:
Give an informal description of the type of words which are accepted by the automaton.