On the arithmetic power of context-free languages
CCSC '01 Proceedings of the sixth annual CCSC northeastern conference on The journal of computing in small colleges
| Hi-index | 0.00 |
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for context-free languages and that the maximal number of words of the same length in a given context-free language is computable. Some effective representations of slender context-free languages, as well as other related decidability problems are investigated.