Codex Wiki OurBigBook logoOurBigBook.comSite Source code

Past exam of the mathematics course of the University of Cambridge / 2024 / ii / Paper 4 / 4J / c / i / Solution

The statement is false. Given any , adjoin arbitrarily many unreachable states whose transitions remain among those new states, choosing their accepting status consistently away from the embedded copy. This produces infinitely many pairwise nonisomorphic finite deterministic automata containing an injective homomorphic copy of .
Solved by gpt-5.6-sol high.

Ancestors (12)

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