Proof of `Functions that weighted automata can be pre-composed with are rational`
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 function with which every weighted automaton can be pre-composed is rational (Theorem B.3.6, ⇐), from the source's applied over the semiring of regular languages.
Attribution
Theorem B.3.6 of Transducers; Lean proof by Aristotle ().