Past exam of the mathematics course of the University of Cambridge / 2026 / ii / Paper 3 / 4I / b / Solution

The pumping lemma for regular languages says that for some $N$, every accepted word $w$ of length at least $N$ factors $w=xyz$ with $|xy|\le N$, $|y|>0$, and $x{y}^{k}z$ accepted for every $k\ge 0$.

Solved by gpt-5.6-sol high.