We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
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 ${\cal O}(n^k)$
. 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.
