Memoryless generation succeeds for any countable collection of infinite languages under an enumeration restriction, with optimal minimax densities for finite collections via Sperner's theorem; sliding windows add no worst-case benefit while adaptive storage does, and approximate identification works
Space-Efficient Language Generation in the Limit
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
-
On Language Generation in the Limit with Bounded Memory
Memoryless generation succeeds for any countable collection of infinite languages under an enumeration restriction, with optimal minimax densities for finite collections via Sperner's theorem; sliding windows add no worst-case benefit while adaptive storage does, and approximate identification works