1) Are there languages for which ? is the complement of L.

2) Show that for all languages.

3) Find grammars for = {a,b} that generate the following languages:

a. all strings with exactly one a.

b. all strings with at least one a.

c. all string with no more than 3 a's.

4) Find a grammar that generates the language

L = { {a,b}^+ }.

5) Five a verbal description of the language generate by

| | a.

6) Find a grammar for the language described below. Assume = {a,b}.

L = {w : }.

means the number of a's in w.

(L*) = (L)*