Proof of `Word-RAM evaluation of tree automata` (1st statement)
groundedproofs/Lax53Proofs/AutomatonLinearTime.lean · lax-53
What this proof establishes
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 fixed-automaton statement is the quantifier-order specialization of the uniform implementation. Its coefficients absorb the automaton workload; it does not claim a separate effective program generator.