Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Past exam of the mathematics course of the University of Cambridge / 2026 / ii / Paper 2 / 4I / c / Solution

The Myhill-Nerode theorem says this quotient is, up to isomorphism, the unique accessible DFA with the least possible number of states accepting the language.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. C
  2. 4I
  3. Paper 2
  4. Ii
  5. 2026
  6. Past exam of the mathematics course of the University of Cambridge
  7. Mathematics course of the University of Cambridge
  8. Course of the University of Cambridge
  9. University of Cambridge
  10. List of universities
  11. Home