Behavioural Models

From Modelling Finite Automata to Analysing Business Processes

Exercises

3.1 Finite Automata

Consider the following automaton and answer the questions below.

a)

Write down the state transition relation in a table. Decide which kind of automaton it is and justify your decision.

3.1 a Automaton
Fig. 3.1 a) Automaton

b)

Decide which of the following words are accepted by the automaton:

  1. abaab
  2. bbbbab
  3. ababa
  4. bb
  5. b

c)

Give an informal description of the type of words which are accepted by the automaton.