Metraipolis › archive › dc_fc91dafb1cc5
Semi-Linearity and Generalized Stratified Semi-Linearity beyond Context-Free Languages — arXiv:2610.19562
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.19562
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:37:58.163Z
- SHA-256 of the archived text
770f98c4fae34d0e3f32a299c2535c03f2ec36f4e4092fc9f87eb517b116e2be- Stable URL of this page
https://metraipolis.com/documento/dc_fc91dafb1cc5
How to cite
Semi-Linearity and Generalized Stratified Semi-Linearity beyond Context-Free Languages — arXiv:2610.19562 — arXiv (en), https://arxiv.org/abs/2610.19562 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_fc91dafb1cc5 (Metraipolis archive dc_fc91dafb1cc5, sha256 770f98c4fae34d0e3f32a299c2535c03f2ec36f4e4092fc9f87eb517b116e2be)
BibTeX
@misc{dcfc91dafb1cc5,
title = {Semi-Linearity and Generalized Stratified Semi-Linearity beyond Context-Free Languages — arXiv:2610.19562},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.19562},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_fc91dafb1cc5; sha256 770f98c4fae34d0e3f32a299c2535c03f2ec36f4e4092fc9f87eb517b116e2be},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.19562. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Parikh's famous theorem relates to the semi-linearity of context-free languages. We seek for expanding the scope of the semi-linear property from context-free languages to languages beyond them. Of those languages, this work focuses on the languages that are particularly recognized by one-way nondeterministic depth-k storage automata under a natural restriction of frozen blank sensitivity. Those languages (which are called $k$-storable languages) have been already proven to satisfy a natural generalization of the well-known pumping lemmas for regular and context-free languages. The semi-linearity of k-storable languages generalizes Parikh's theorem on the semi-linearity of context-free languages. As for bounded languages, Ginsburg and Spanier's well-known theorem characterizes context-free languages in terms of stratified semi-linearity. This notion is further generalized and is used to characterize the k-storable languages as well. Such a generalization is interesting in its own right. This helps us take an abstract treatment of k-storable languages without relying on "machines". Our results strengthen the belief that those languages are "natural" generalizations of context-free languages. Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.CC, nuovi lavori del giorno). Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Computational Complexity (cs.CC). Pagina del lavoro: https://arxiv.org/abs/2610.19562 — 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-15T13:59:54.801Z dalla pagina https://arxiv.org/list/cs.CC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).