Metraipolis › archive › dc_cfdbf21c73d6

Non-Terminal Complexity of Simple Semi-Conditional Grammars — arXiv:2609.14181

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.14181
License (as archived)
CC0-1.0
Archived
2026-10-16T01:38:27.509Z
SHA-256 of the archived text
e5d7c69cb8f8a2746a7a6b09a4274b9082085fb0cabacb59d43c9a4e7631aacb
Stable URL of this page
https://metraipolis.com/documento/dc_cfdbf21c73d6

How to cite

Non-Terminal Complexity of Simple Semi-Conditional Grammars — arXiv:2609.14181 — arXiv (en), https://arxiv.org/abs/2609.14181 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cfdbf21c73d6 (Metraipolis archive dc_cfdbf21c73d6, sha256 e5d7c69cb8f8a2746a7a6b09a4274b9082085fb0cabacb59d43c9a4e7631aacb)
BibTeX
@misc{dccfdbf21c73d6,
  title = {Non-Terminal Complexity of Simple Semi-Conditional Grammars — arXiv:2609.14181},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.14181},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cfdbf21c73d6; sha256 e5d7c69cb8f8a2746a7a6b09a4274b9082085fb0cabacb59d43c9a4e7631aacb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14181. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the complexity of simple semi-conditional grammars (SSCGs) in terms of the number of their terminals and non-terminals. We show that SSCGs with three non-terminals can generate all RE languages; two non-terminals suffice for linear languages; and one suffices for unary regular languages. We also determine both upper bounds and fundamental limitations of SSCGs: while certain one-non-terminal SSCGs can generate non-context-free languages, every language generated by a one-non-terminal SSCG is in non-deterministic linear space. We also prove that there exists a regular language of alphabet size at least 3 which cannot be generated by any one-non-terminal SSCG. Finally, we prove that membership testing for SSCGs of two non-terminals is already NP-hard.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-15 in math.LO).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Logic (math.LO).
Pagina del lavoro: https://arxiv.org/abs/2609.14181 — 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-16T01:22:41.494Z dalla pagina https://arxiv.org/catchup/math.LO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).