Proof of `Computable bounds for the algebraic branch automaton`
groundedproofs/Lax369799Proofs/QuantitativeWordConditions.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
The linked-pair Buchi automaton records three monoid elements and two flags. Apply the explicit determinization bound and then multiply by the finite-word evaluator state count. Neither bound depends on the values of the algebra's multiplication or accepting tables.