Proof of `Deciding whether a rational function is a Mealy machine`
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 66 of the paper of lax-157538, Transducers
Description
Deciding whether a rational function is a Mealy machine (Theorem B.4.2): prefix preservation is reduced to the equality of two rational functions (), decided by Theorem B.3.4 ().
Attribution
Theorem B.4.2 of Transducers; Lean proof by Aristotle ().