Metraipolis › archive › dc_a95cd37706e8
Separating Parsing Expression Grammars using Cell-Probe Lower Bounds — arXiv:2608.29592
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.29592
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-17T10:07:18.215Z
- SHA-256 of the archived text
e6e73ad4918427bccd25994d3609262376889cc7c7ad0f03c9aea782191cd3b1- Stable URL of this page
https://metraipolis.com/documento/dc_a95cd37706e8
How to cite
Separating Parsing Expression Grammars using Cell-Probe Lower Bounds — arXiv:2608.29592 — arXiv (en), https://arxiv.org/abs/2608.29592 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_a95cd37706e8 (Metraipolis archive dc_a95cd37706e8, sha256 e6e73ad4918427bccd25994d3609262376889cc7c7ad0f03c9aea782191cd3b1)
BibTeX
@misc{dca95cd37706e8,
title = {Separating Parsing Expression Grammars using Cell-Probe Lower Bounds — arXiv:2608.29592},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.29592},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_a95cd37706e8; sha256 e6e73ad4918427bccd25994d3609262376889cc7c7ad0f03c9aea782191cd3b1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.29592. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We resolve three open problems concerning parsing expression grammars (PEGs). We construct a single language $C$ satisfying $C\in\mathsf{LIN}\cap\mathsf{PEG}$ and $C^R\in\mathsf{LIN}\setminus\mathsf{PEG}$. This proves that some linear context-free language is not a PEG language and that PEG languages are not closed under reversal, confirming a conjecture of Loff, Moreira, and Reis. Factoring the same witness resolves the concatenation-closure problem of Rubtsov and Chudinov negatively, in the strong form $\mathsf{PEG}\cdot\mathsf{REG}\not\subseteq\mathsf{PEG}$ despite $\mathsf{REG}\cdot\mathsf{PEG}\subseteq\mathsf{PEG}$. It also refutes closure under Kleene star, homomorphisms, and substitutions. Our main technique converts scaffolding automata (SCAs), which characterize reversals of PEG languages, into dynamic data structures in the cell-probe model. For any suitably local serialization of a problem with preprocessing, updates, and a final Boolean query, an SCA recognizer yields an exact deterministic cell-probe data structure whose operation costs are proportional to the corresponding encoding lengths. Cell-probe lower bounds can therefore prove SCA non-membership and, by reversal, PEG non-membership. We apply this transfer to Multiphase Inner Product using one-symbol update blocks and a query suffix of length $O(\log n)$, while keeping both the language and its reversal linear context-free. Ko's cell-probe lower bound then yields the witness above. The arguments are additionally formalized in Lean 4.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-01 in cs.CC).
Categorie arXiv: Programming Languages (cs.PL) ; Computational Complexity (cs.CC); Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2608.29592 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T10:02:18.388Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).