RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES
Arseny M. Shur · International Journal of Foundations of Computer Science · 2007
We approximate factorial languages by languages with finite antidictionaries. Let s and m be positive integers with s ≤ m. We construct a language of complexity Θ(ns), and a sequence of languages with finite antidictionaries, each of those having the complexity Θ(nm), such that this sequence converges to the original language.