Proof of `Eilenberg's theorem: rational functions, unambiguous automata and bimachines`
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 45 of the paper of lax-157538, Transducers
Description
Eilenberg's theorem as a , glued from the three implications with content, taken as assumptions, and the trivial (2) ⇒ (1).