Proof of `Recurring priorities in finite-state runs` (1st statement)
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
The parity condition is exactly evenness of the unique least recurring priority of the word automaton's run.