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.
Representative language generation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
-
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.