On a conjecture about slender context-free languages

We prove that every slender context-free language is a union of paired loops, thus confirming a conjecture of Paˇun and Salomaa to appear. A series of consequences of this result are inferred, most of them also left as open problems in recent papers about slender languages.