A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
On slender 0L languages over the binary alphabet
Tekijät: Honkala J
Kustantaja: SPRINGER VERLAG
Julkaisuvuosi: 2000
Journal: Acta Informatica
Tietokannassa oleva lehden nimi: ACTA INFORMATICA
Lehden akronyymi: ACTA INFORM
Vuosikerta: 36
Numero: 9-10
Aloitussivu: 805
Lopetussivu: 815
Sivujen määrä: 11
ISSN: 0001-5903
DOI: https://doi.org/10.1007/s002360050175
Tiivistelmä
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.
Turun yliopiston Tutkimustietojärjestelmän portaali