Proof of `Decidable zeroness of weighted automata over the rationals`
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 64 of the paper of lax-157538, Transducers
Description
Decidable zeroness of weighted automata over (Theorem B.3.7), the special case of equivalence with the empty automaton ().
Attribution
Theorem B.3.7 of Transducers; Lean proof by Aristotle ().