Solution

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

The pumping lemma for context-free languages states that for every context-free language there is a pumping length such that every with can be written
with

New to topics? Read the docs here!