 Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2025/ii/paper-3/12f/b/i/solution

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

Define the extended transition recursively by

Δ (q, ε) = {q}, Δ (q, w a) = ⋃_{p \in Δ (q, w)} Δ (p, a) .

The automaton accepts

w

precisely when

w \in L (N) ⟺ Δ (q_{0}, w) \cap F \neq = \emptyset .

 New to topics? Read the docs here!