Non-asymptotic length generalization is equivalent to decidability of language equivalence; DFAs generalize after length 2n-2, C-RASP1 after O(T^2), C-RASP2 after O(T^{O(K)}).
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Non-Asymptotic Length Generalization
Non-asymptotic length generalization is equivalent to decidability of language equivalence; DFAs generalize after length 2n-2, C-RASP1 after O(T^2), C-RASP2 after O(T^{O(K)}).