A characterization of poly-slender context-free languages
Lucian Ionel Ilie, Grzegorz Rozenberg, Arto K. Salomaa · RAIRO - Theoretical Informatics and Applications · 2000
For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order . We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.