Proof of `Rankwise-finite recognition implies automaton recognition`
groundedproofs/Lax369799Proofs/AlgebraToAutomaton.lean · lax-369799
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
Use the finite unary and nullary sorts of the yield-syntactic algebra. The linked-pair word condition makes accepting evaluated runs precisely accepting automaton runs. Every accepted input has such a run, and monotonicity transfers acceptance of a run back to the input.