{"ID":23475148,"CreatedAt":"2026-09-18T01:09:05.407443952Z","UpdatedAt":"2026-09-20T18:11:56.143995915Z","DeletedAt":null,"paper_url":"https://arxiv.org/abs/2609.19940","arxiv_id":"2609.19940","title":"Stringological sequence prediction III: layered ziplines and a tradeoff between efficiency and expressivity","abstract":"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.","short_abstract":"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...","url_abs":"https://arxiv.org/abs/2609.19940","url_pdf":"https://arxiv.org/pdf/2609.19940v1","authors":"[\"Vanessa Kosoy\"]","published":"2026-09-17T09:15:29Z","proceeding":"cs.FL","tasks":"[\"cs.FL\",\"cs.DS\",\"cs.LG\"]","methods":"[\"Generative Adversarial Network\"]","has_code":false}