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.
Codex Wiki