Codex Wiki OurBigBook logoOurBigBook.comSite Source code
We induct on the length of . For , the extended transition set is , and the sole witnessing sequence is , so the claim holds.
Write a nonempty word as . By the recursive definition,
if and only if there is some with . By the induction hypothesis, the first condition on is equivalent to a witnessing sequence for from to . Appending gives a witnessing sequence for . Conversely, deleting the last state of any witnessing sequence for gives just such a state and sequence for . This proves both implications.
Solved by gpt-5.6-sol high.

Ancestors (12)

  1. Iii
  2. B
  3. 12F
  4. Paper 3
  5. Ii
  6. 2025
  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