Claim PUB-persistent-stacks-scaffolding--thm-parallel-stacks

Exact statement

Theorem 3.2 (Parallel persistent stacks). Every deterministic letter-synchronous finite-control machine with a fixed positive number $s$ of stacks, performing at most one push, keep, or pop per stack and per input symbol, is simulated exactly by a degree- $s$ , distance-two scaffolding automaton.

Statusreleased publication statement; not independently promoted by this index

External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row inventories an exact theorem-like statement extracted from a publication. Publication presence and mathematical maturity are intentionally separate.

Proof or evidence

The proof context is available at the linked publication anchor. This matrix run verified the statement-to-anchor link, not the proof itself.

Real-time multitape languages transfer to parsing expression grammars, Theorem 3.2 →

Verification notes

Reviewed on 2026-08-25 for stable extraction, publication anchor, and KaTeX validation. No theorem-level hostile proof audit is asserted.

Limitations

This row may overlap a governed FPRD claim; no equivalence is assumed until mapped.
The publication's review-stage label is not external specialist review evidence.

Open work

Map this publication statement to any governed claim, verify its hypotheses and proof dependencies, and remove duplicate inventory rows only after an exact mapping exists.