CS F351 Theory of Computation

Tutorial-5

Note: ∗ marked problems can be left to the students to try after the tutorial.

Problem 1 Prove that the following languages are not regular by using pumping lemma for
regular languages.

1. L = {ss | s ∈ {0, 1}∗ }

2. L = {0n s | n ≥ 0, s ∈ {0, 1}∗ and |s| ≤ n}

3. L = {w ∈ {a}∗ : |w| = 2n , n ≥ 0}

4. L = {(10)m 1n : m, n ∈ N, m ≥ n}

5. (∗) L = {0n (12)m | n ≥ m ≥ 0}

6. (∗) L = {an bl | n ̸= l} over Σ = {a, b}