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

A variable-based grammar is $(N,\Sigma ,P,S)$ with disjoint nonterminals and terminals, productions between words over $N\cup \Sigma$, and start variable $S$. Its language is $\{w\in {\Sigma }^{\ast }:S{\Rightarrow }^{\ast }w\}$.

Solved by gpt-5.6-sol high.