Concluding Home Exercise

Each question below gives 15 points, but the combined grade will not exceed
100 points.

1. Construct a DFA for the following language in Σ = {𝑎, 𝑏}:

𝐿 = {𝑎𝑛 𝑏 𝑚 | 𝑛%3 = 𝑚%3}
2. Provide a regular expression for the following language in the
alphabet Σ = {0,1}:

Words of even length in which 0 must follow immediately after

every string 11.

3. Construct a CFG for the following language:

𝐿 = {𝑤1 𝑎𝑛 𝑏 𝑚 𝑤2 |𝑤𝑖 ∈ {𝑎, 𝑏}∗ , 𝑖 ∈ {1,2}, |𝑤𝑖 | = 2𝑘
𝑤1 = 𝑤2𝑅 , 𝑛 = 2𝑚, 𝑛, 𝑚, 𝑘 ∈ 𝑁}

4. Build a PDA for the language above.

5. Minimize the automaton below:

6. Using the Pumping Lemma, show that the following language is not
regular:
L = { c (n+2m)anb2m| n,m0}.

7. Show that the above language is not regular using homomorphisms.

8. Using the Pumping Lemma, show that the following language is not
context-free:
𝐿 = {𝑤 ∈ {a, b, c}∗ | #𝑎 (𝑤) = 2 ∙ #𝑏 (𝑤) < #𝑐 (𝑤)}