Metraipolis › archive › dc_18c7dbddeaa3

From k+1 to k heads the descriptive trade-off is non-recursive — arXiv:2610.11958

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.11958
License (as archived)
CC0-1.0
Archived
2026-10-09T06:36:32.184Z
SHA-256 of the archived text
c98ec1a42a9bbc833bcfe040bc98d6653ee059bbcc8dc260ce14b303e393775b
Stable URL of this page
https://metraipolis.com/documento/dc_18c7dbddeaa3

How to cite

From k+1 to k heads the descriptive trade-off is non-recursive — arXiv:2610.11958 — arXiv (en), https://arxiv.org/abs/2610.11958 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_18c7dbddeaa3 (Metraipolis archive dc_18c7dbddeaa3, sha256 c98ec1a42a9bbc833bcfe040bc98d6653ee059bbcc8dc260ce14b303e393775b)
BibTeX
@misc{dc18c7dbddeaa3,
  title = {From k+1 to k heads the descriptive trade-off is non-recursive — arXiv:2610.11958},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.11958},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_18c7dbddeaa3; sha256 c98ec1a42a9bbc833bcfe040bc98d6653ee059bbcc8dc260ce14b303e393775b},
  year = {2026}
}

Archived text

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

We prove that no recursive function can upper bound the increase in the size of description when a two-way deterministic finite automaton with k+1 heads is replaced by an equivalent two-way deterministic finite automaton with k heads. This is true for all k, and remains true if the automata are unary and/or nondeterministic.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.FL, nuovi lavori del giorno).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL).
Pagina del lavoro: https://arxiv.org/abs/2610.11958 — 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-09T05:57:46.401Z dalla pagina https://arxiv.org/list/cs.FL/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).