Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2018/ii/paper-1/4g/a/solution

The pumping lemma for context-free languages states that every context-free language has a pumping length such that every with can be written
with , , and for every integer .

New to topics? Read the docs here!