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 $L$ there is a pumping length $p$ such that every $w\in L$ with $|w|\ge p$ can be writtenwith