arXiv:2601. 12621v2 Announce Type: replace-cross Abstract: It is well known that computing a minimum deterministic finite automaton consistent with a given set of positive and negative examples is NP-hard.
By Radu Cosmin Dumitru, Ryo Yoshinaka, Ayumi Shinohara
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:2609.08961v1 Announce Type: cross
Abstract: For a finite set $O$ of Boolean functions, we consider the class of propositional formulas built using the functions in $O$ as connectives. We determ...
By Balder ten Cate
arXiv:2606. 16077v1 Announce Type: cross Abstract: In this note, we introduce a polynomial-time version of the mistake-bounded language generation (MBLG) framework due to Kleinberg, Peale, and Reingold (2026).
By H\'ector Jimenez, Alexander Kozachinskiy, Vicente Opazo
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:2609.23094v1 Announce Type: cross
Abstract: We study the number of prototypes needed to represent Boolean functions by nearest-neighbour classification. There are two distinct settings: the pro...
By Martin Anthony