Past exam of the mathematics course of the University of Cambridge / 2026 / ii / Paper 1 / 12I / b / Solution

A type-2 rule is $A\to \alpha$ with one nonterminal $A$ on the left; a type-2 grammar and its language are context-free languages. The required repetition criterion is the pumping lemma for context-free languages.

Solved by gpt-5.6-sol high.