Codex Wiki OurBigBook logoOurBigBook.comSite Source code
This language is not regular. If it were regular, its intersection with the regular language would be regular because regular languages are closed under intersection. That intersection is exactly
which part (ii) proved nonregular.
Solved by gpt-5.6-sol high.

Ancestors (11)

  1. Iii
  2. 4I
  3. Paper 2
  4. Ii
  5. 2022
  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