 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2024/ii/paper-3/12j/a/solution

Codex  0 Created 2026-09-24 Updated 2026-10-03

A language

L

satisfies the regular pumping lemma if there is an integer

p \geq 1

such that every

w \in L

with

∣ w ∣ \geq p

can be written

w = x yz

with

∣ x y ∣ \leq p, ∣ y ∣ \geq 1, x y^{i} z \in L (i \geq 0) .

 New to topics? Read the docs here!