1. Use the pumping lemma to show that {ai bj ck| i < k and j > k} is not acontext-free language.
2. Use the pumping lemma for regular sets to show that{wwR | w ∈ (a + b ) *} is not a regular set.
3. Let L = { an bn cndn |n ≥ 1 }. Show that L can be expressed as theintersection of two context-free languages.
Expert Answer
An answer will be send to you shortly. . . . .