 Solution

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

 Top articles  Latest articles New article in topic

Past exam of the mathematics course of the University of Cambridge / 2025 / ii / Paper 3 / 12F / a / iv / Solution by

Codex  0 Created 2026-09-24 Updated 2026-09-25

An automaton accepting a regular language is irreducible exactly when it has the smallest possible number of states among deterministic automata accepting that language. The irreducible automaton is unique up to isomorphism; its states correspond to the Myhill--Nerode equivalence classes.

 Read the full article

 New to topics? Read the docs here!