Proof of `Büchi's theorem: regular languages are the MSO-definable ones`
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 118 of the paper of lax-157538, Transducers
Description
Büchi's theorem (Theorem C.4.1) as a biconditional, glued from its two halves taken as assumptions.