Abstract. A language \(L\) is called slender if there exists a constant \(k\) such that \(L\) contains no \(k\) words of equal length. In this paper we continue the study of relationships between slender languages and bounded languages. We show that if a 0L language \(L\) over a two-letter alphabet is slender then \(L\) is a D0L language or \(L\) is a bounded language. As an application we prove the decidability of the slenderness problem in many cases.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 13 September 1999 / 2 February 2000
Rights and permissions
About this article
Cite this article
Honkala, J. On slender 0L languages over the binary alphabet. Acta Informatica 36, 805–815 (2000). https://doi.org/10.1007/s002360050175
Issue Date:
DOI: https://doi.org/10.1007/s002360050175