×

On the subword complexity of locally catenative DOL languages. (English) Zbl 0501.68038


MSC:

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

References:

[1] Ehrenfeucht, A.; Rozenberg, G., On the subword complexity of square-free DOL languages, Theoret. Comput. Sci., 16, 25-32 (1981) · Zbl 0481.68073
[2] Ehrenfeucht, A.; Rozenberg, G., On the subword complexity of DOL languages with a constant distribution, Inform. Process. Lett., 13, 108-114 (1981) · Zbl 0546.68062
[3] Lee, K. P., Subwords of developmental languages, Ph.D. Thesis (1975), Dept. of Computer Science, State University of New York: Dept. of Computer Science, State University of New York Buffalo
[4] Rozenberg, G., On subwords of formal languages, (Lecture Notes in Comput. Sci., 117 (1981), Springer: Springer Berlin), 328-333 · Zbl 0481.68074
[5] Rozenberg, G.; Salomaa, A., The Mathematical Theory of \(L\) Systems (1981), Academic Press: Academic Press London-New York · Zbl 0365.68072
[6] Thue, A., Uber unendliche Zeichenreihen, Norsk. Vid. Selsk. Skr. I. Mat. Nat. K1., 7, 1-22 (1906) · JFM 39.0283.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.