×

On the size of the alphabet and the subword complexity of square-free DOL languages. (English) Zbl 0512.68058


MSC:

68Q45 Formal languages and automata
PDFBibTeX XMLCite
Full Text: DOI EuDML

References:

[1] Bean, D. R., Ehrenfeucht, A. and McNulty, G. F.,Avoidable patterns in strings of symbols, Pacific Journal of Mathematics, 85, (1979), 261–294. · Zbl 0428.05001
[2] Berstel, J.,Sur les most sans carré définis par un morphisme, Lecture Notes in Computer Science, 71, (1979), 16–25.
[3] Berstel, J.,Mots sans carré et morphismes itérés, univ. Paris 7, Institut de Programmation, Techn. Rep. 78–42, (1978).
[4] Ehrenfeucht, A. and Rozenberg, B.,On the subword complexity of square-free DOL languages, Theoretical Computer Science, 16, (1981), 25–32. · Zbl 0481.68073
[5] Ehrenfeucht, a. and Rozenberg, G.,On the subword complexity of DOL languages with a constant distribution, Information Processing Letters, 13, (1981), 108–113. · Zbl 0546.68062
[6] Lee, K. P.,Subwords of developmental languages, Ph.D. thesis, State University of New York at Buffalo, 1975.
[7] Rozenberg, G. and Salomaa, A.,The mathematical theory of L systems, Academic Press, London-New York, (1980). · Zbl 0508.68031
[8] Salomaa, N.,Jewels of formal languages, Computer Science Press, to appear. · Zbl 0487.68063
[9] Salomaa, A.,Morphisms and language theory, in: R. Book (ed.),Formal languages, Academic Press, New York, London, (1980).
[10] Thue, A.,Über die gegenseitigen Lage gleicher Teile gewisser Zeichenreihen, Norske Vid. Selsk. Skr., I Mat. Nat. KL., Christiania, 1, (1912), 1–67. · JFM 44.0462.01
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.