A poly(s,k)-space streaming algorithm achieves generation gap O(k^{2s-2}) for DFA languages with s states over k symbols and captures all strings of length at least 2s-1, with a near-matching lower bound via communication complexity.
On union-closedness of language generation
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 3roles
background 1polarities
background 1representative citing papers
Under the stricter Banach-density measure, valid generation in the limit guarantees the optimal 1/2 coverage exactly when the language collection has finite Cantor-Bendixson rank; other collections force arbitrarily large sparse holes, and in dimension ≥ 2 geometry alone forces density zero.
Defines mistake-bounded generation and gives an algorithm for finite classes achieving optimal last-mistake time Cdim(L) with floor(log2 |L|) mistakes, plus a trade-off for infinite classes and noisy extensions.
citing papers explorer
-
Space-Efficient Language Generation in the Limit
A poly(s,k)-space streaming algorithm achieves generation gap O(k^{2s-2}) for DFA languages with s states over k symbols and captures all strings of length at least 2s-1, with a near-matching lower bound via communication complexity.
-
Validity, Sparse Holes, and Breadth in Language Generation: Banach Density, Topology, and Geometry
Under the stricter Banach-density measure, valid generation in the limit guarantees the optimal 1/2 coverage exactly when the language collection has finite Cantor-Bendixson rank; other collections force arbitrarily large sparse holes, and in dimension ≥ 2 geometry alone forces density zero.
-
Mistake-Bounded Language Generation
Defines mistake-bounded generation and gives an algorithm for finite classes achieving optimal last-mistake time Cdim(L) with floor(log2 |L|) mistakes, plus a trade-off for infinite classes and noisy extensions.