Proof of `Finite stack alphabets suffice`
groundedproofs/Lax554803Proofs/ModelEquivalence.lean · lax-554803
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
Retain the input/output symbols and the finite ranges of push instructions. Restricting each stack alphabet to these symbols preserves every transition and the original time polynomial.