PROBLEMS

1. Write out the transition table for the FA's on pages 68, 70 (both), 73,
74 and 80 that were defined by pictures. If the states in the pictures
were not labeled, assign them names so that we can build the table.
2. Build an FA that accepts only the language of all words with b as the
second letter. Show both the picture and the transition table for this
machine and find a regular expression for the language.
3. Build an FA that accepts only the words baa, ab, and abb and no other
strings longer or shorter.
4. (i) Build a new FA that accepts only the word A.
(ii) Build an FA with three states that accept all words.
5. Build an FA that accepts only those words that have an even number
of letters total.
6. Build an FA that accepts only those words that do not end with ba.
7. Build an FA that accepts only those words that begin or end with a
double letter.
8. (i) Build an FA that accepts only those words that have more than four
letters.
(ii) Build an FA that accepts only those words that have fewer than four
letters.

82 AUTOMATA THEORY
9. Problems 2 through 12 of Chapter 4 include 14 languages that could be
represented by regular expressions. For each of these find an FA that
accepts exactly it.
10. So far we have been dealing with Fa's over the alphabet. {a, b}.
Let us consider for the moment the alphabet I = {a, b, c}.
(i) If we had an FA over this alphabet with five states, how many entries
would there be in the transition table?
(ii) In the picture of this five-state machine, how many edges would need
to be drawn in total (counting an edge with two labels double and an
edge with three labels triple)?
(iii) Build an FA that accepts all the words in this alphabet that have an
a in them somewhere that is followed later in the word by some b
that is followed later in the word by some c ·(the three being not
necessarily in a row but in that order, as in abaac).
(iv) Write a regular expression for the language accepted by this machine.

11 . Recall from Chapter 4 the language of all words over the alphabet {a,
b} that have both the letter a and the letter b in them, but not necessarily
in that order. Build an FA that accepts this language.
12. Build an FA that accepts the language of all words with only a's or
only b's in them. Give a regular expression for this language.