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