Journal article
A characterization of poly-slender context-free languages
Abstract
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.
Authors
Ilie L; Rozenberg G; Salomaa A
Journal
RAIRO - Theoretical Informatics and Applications, Vol. 34, No. 1, pp. 77–86
Publisher
EDP Sciences
Publication Date
1 2000
DOI
10.1051/ita:2000100
ISSN
0988-3754