Proof of `Finite stack alphabets suffice`
groundedproofs/Lax434930Proofs/ModelEquivalence.lean · lax-434930
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 3 of this submission's paper
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.