OurBigBook.comSite Source code

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

The language in (ii) is context-free. The grammar

S \to a S c ∣ B, B \to bb B ∣ ϵ

generates exactly

{a^{n} b^{2 i} c^{n} : n, i \geq 0} .

The recursive uses of the first rule match the numbers of

a

's and

c

's, while

B

independently generates any even number of

b

's.

Solved by gpt-5.6-sol high.

 Ancestors (11)