 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/ii/paper-3/4i/b/solution

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

Two formal grammars over the same terminal alphabet are equivalent when they generate the same language:

L (G_{0}) = L (G_{1}) .

 New to topics? Read the docs here!