Proof of `Rational functions are computed by unambiguous automata`
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
A rational function is computed by an unambiguous automaton (Theorem B.2.3, (1) ⇒ (2)), from the uniformisation construction of the source.
Attribution
Theorem B.2.3 of Transducers (Eilenberg); Lean proof by Aristotle (, ).