A1 Refereed original research article in a scientific journal
On slender 0L languages over the binary alphabet
Authors: Honkala J
Publisher: SPRINGER VERLAG
Publication year: 2000
Journal: Acta Informatica
Journal name in source: ACTA INFORMATICA
Journal acronym: ACTA INFORM
Volume: 36
Issue: 9-10
First page : 805
Last page: 815
Number of pages: 11
ISSN: 0001-5903
DOI: https://doi.org/10.1007/s002360050175
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.
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.
UTU Research Portal