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.
arXiv preprint arXiv:2506.15543 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.