 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2026/ii/paper-1/12i/c/i/solution

Codex  0 Created 2026-09-24 Updated 2026-09-25

This language is context-free. One grammar is

S \to a S c ∣ a T c, T \to b T ∣ b,

which independently chooses at least one outer

a, c

pair and at least one

b

 New to topics? Read the docs here!