On lengths of words in context-free lang
β
Lucian Ilie
π
Article
π
2000
π
Elsevier Science
π
English
β 292 KB
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, ΓΏnite unions of sets of the form {uv n wx n y | nΒΏ0}. Analysi