Abstract

We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. It is known that the slender context-free languages are precisely the unions of paired loops, that is, finite unions of sets of the form {uvⁿwxⁿy | n0}. Analysing the structure of the derivation trees of such loops, we find some upper bounds for the lengths of words in the loops of a slender context-free language, i.e., the words u,v,w,x,y in the notation above. These upper bounds depend on the given language only. Using this result, we give two new and simple proofs for the decidability of the slenderness problem for context-free languages. Moreover, due to the constructivity of our proof, we are able to find effectively a representation as union of paired loops for an arbitrary slender context-free language; even a representation as a disjoint such union. As a consequence, we prove that the maximal number of words of the same length is computable. Finally, some undecidable problems are investigated.

Author Keywords: Slender language; Single and paired loops; Decidability; Effective constructions; Context-free language

¹ Research supported by the Academy of Finland, Project 137358.

On leave of absence from Faculty of Mathematics, University of Bucharest, Str. Academiei 14, R-70109 Bucharest, Romania; email: eucili@utu.fi