cs.FL · 2026-09-20 · No. 119

Formal Languages and Automata Theory, 2026-09-20.

1 new papers in cs.FL. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

1 entries
  1. 01

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

    Vanessa Kosoy

    cs.FL · cs.DS · cs.LG

    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...

    arxiv.org/abs/2609.19940 · PDF

This edition is part of The Daily Abstract — cs.FL archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.