Metraipolis › archive › dc_f4ad10481e08

Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity — arXiv:2609.19940

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.19940
License (as archived)
CC0-1.0
Archived
2026-10-10T04:09:18.909Z
SHA-256 of the archived text
96e692aa8045bee84a26df8068b2924f4ecc5d914131b52d4145901489127f94
Stable URL of this page
https://metraipolis.com/documento/dc_f4ad10481e08

How to cite

Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity — arXiv:2609.19940 — arXiv (en), https://arxiv.org/abs/2609.19940 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f4ad10481e08 (Metraipolis archive dc_f4ad10481e08, sha256 96e692aa8045bee84a26df8068b2924f4ecc5d914131b52d4145901489127f94)
BibTeX
@misc{dcf4ad10481e08,
  title = {Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity — arXiv:2609.19940},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.19940},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f4ad10481e08; sha256 96e692aa8045bee84a26df8068b2924f4ecc5d914131b52d4145901489127f94},
  year = {2026}
}

Archived text

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

In previous papers, we began the study of sequence prediction algorithms adapted to stringological word complexity measures. In particular, we defined a complexity measure called Arithmetic Repetition Complexity (ARC) which admits a polynomial-time prediction algorithm with a mistake bound quasilinear in the complexity. Here, we show a weaker complexity measure related to ARC that admits an especially efficient prediction algorithm: an algorithm that runs in quasilinear time and polylog space for appropriate highly-structured sequences. The complexity measure is defined via a restricted class of "zipline programs" (a variant of straight-line programs), which we call layered. We thus get a less expressive measure with a more efficient algorithm (compared to our results for ARC), demonstrating a possible tradeoff.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-18 in cs.LG).
Categorie arXiv: Formal Languages and Automata Theory (cs.FL) ; Data Structures and Algorithms (cs.DS); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.19940 — 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-10T03:48:18.422Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).