cs.DS · 2026-05-30 · No. 12

Data Structures and Algorithms, 2026-05-30.

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

01 — The papers

1 entries
  1. 01

    On Language Generation in the Limit with Bounded Memory

    Jon Kleinberg, Anay Mehrotra, Amin Saberi, Grigoris Velegkas

    cs.DS · cs.AI · cs.CL · cs.LG · stat.ML

    We study language generation in the limit under bounded memory. In this task, a learner observes examples from an unknown target language one at a time and must eventually output only new valid examples. Prior work assumes access to the entire history, a strong assumption since realistic algorithms retain limited past information. Classical work in learning theory shows memory constraints dramatically alter learnability; we extend this to...

    arxiv.org/abs/2605.30324 · PDF

This edition is part of The Daily Abstract — cs.DS 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.