Skip to main content
SpringerLink
Log in

On slender 0L languages over the binary alphabet

  • Original articles
  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Turku, 20014 Turku, Finland (e-mail: juha.honkala@utu.fi) and Turku Centre for Computer Science (TUCS), Lemminkäisenkatu 14, 20520 Turku, Finland , , , , , , FI

    Juha Honkala

Authors
  1. Juha Honkala
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 13 September 1999 / 2 February 2000

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050175

Keywords

Search

Navigation