Solution

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

Extend to
by
The extended transition function of a deterministic finite automaton processes a whole word from left to right. The language accepted by is

New to topics? Read the docs here!