arXiv:2606. 28947v1 Announce Type: cross Abstract: In this study we present a formal definition of large discrete sets having, informally, three properties: their elements are easily recognized, easily generated, and the latter tasks are easily learned from examples.
By Veit Elser, Manish Krishan Lal
The paper introduces an SMT-based active learning algorithm for nondeterministic weighted finite automata (WFAs), offering a practical alternative to traditional Hankel/L*-style methods. The algorithm is parametric over a chosen semiring and, upon termination, guarantees the production of minimal WFAs. Experiments demonstrate that it learns numerous minimal WFAs over both finite and infinite semirings, outperforming a naive baseline and competing with state‑of‑the‑art algorithms while yielding smaller automata and requiring less teacher interaction.
By Tiago Ferreira, Kevin Batz, Alexandra Silva
arXiv:2511. 15709v2 Announce Type: replace-cross Abstract: Recent works have shown that tokenisation is NP-complete.
By Violeta Kastreva, Philip Whittington, Dennis Komm, Tiago Pimentel
The paper presents a polynomial‑time active learning procedure for deterministic register automata (DRAs) over ordered data domains, covering both dense domains like the rationals and non‑dense domains such as the integers. It unifies the learning framework for these domains using membership, equivalence, and memorability queries, and shows that minimization of DRAs over the integer domain is decidable. Additionally, the authors provide improved complexity bounds for several decision problems related to DRAs over ordered domains.
By Yong Li, Qiyi Tang, Di-De Yen
arXiv:2607. 12443v1 Announce Type: cross Abstract: Motivated by the power of large language models, there has been renewed interest in the Gold-Angluin model of language identification in the limit, with an eye toward variants of the model that might overcome the negative results for its original formulation.
By Moses Charikar, Jon Kleinberg, Chirag Pabbaraju
arXiv:2607. 17369v1 Announce Type: cross Abstract: In a previous paper, we began the study of sequence prediction algorithms adapted to stringological word complexity measures.
By Vanessa Kosoy