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 Lis of order ${\cal O}(n^k)$
. We give a precise characterization of the k-poly-slender context-free languages. The well-known characterizationof the k-poly-slender regular languages is an immediate consequenceof ours.