Proof of `Weighted automata are closed under pre-composition with rational functions`
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.
In the paper
- page 62 of the paper of lax-157538, Transducers
Description
Weighted automata are closed under pre-composition with rational functions (Lemma B.3.5), by the product with an unambiguous ε-free automaton ().
Attribution
Lemma B.3.5 of Transducers; Lean proof by Aristotle ().