Question 1
[10 Points]
Use the Pumping Lemma to demonstrate that the following languages are not
regular.
a) L1 = {w ∈ {0, 1}*: 0<sup>i</sup>1<sup>j</sup> where i ≤ j}
b) L2 = {w ∈ {a, b, c}*: a<sup>i</sup>b<sup>j</sup>c<sup>k+2</sup> where i = k and i, j, k ≥ 0}
c) L3 = {w1#w2 such that |w1| = 2.|w2|, where Σ = {0, 1} }
d) L4 = {w ∈ {a}*: a<sup>2<sup>n</sup></sup> where n ≥ 0}