Culik, Karel II; Salomaa, Arto On infinite words obtained by iterating morphisms. (English) Zbl 0492.68059 Theor. Comput. Sci. 19, 29-38 (1982). Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page Cited in 1 ReviewCited in 19 Documents MSC: 68Q45 Formal languages and automata 68Q42 Grammars and rewriting systems 20M05 Free semigroups, generators and relations, word problems 20M35 Semigroups in automata theory, linguistics, etc. Keywords:omega languages; DTOL systems; prefix-preserving DOL systems; algorithm for the DOL sequence equivalence problem; decidability of the limit language equivalence problem for DOL systems; adherence language equivalence problem; DTOL languages PDF BibTeX XML Cite \textit{K. Culik II} and \textit{A. Salomaa}, Theor. Comput. Sci. 19, 29--38 (1982; Zbl 0492.68059) Full Text: DOI References: [1] Culik, K., The ultimate equivalence problem for DOL systems, Acta Informat., 10, 79-84 (1976) · Zbl 0385.68060 [2] Culik, K., Homomorphisms: decidability, equality and test sets, (Proc. Conference on Formal Languages (December 1979), Academic Press: Academic Press New York), Santa Barbara [3] Culik, K.; Fris, I., The sequence equivalence problem for DOL systems is decidable, Information and Control, 35, 20-39 (1977) · Zbl 0365.68074 [4] Eilenberg, S., Automata, Languages and Machines, Vol. A (1974), Academic Press: Academic Press New York · Zbl 0317.94045 [5] Linna, M., The decidability of the DOL prefix problem, Internat. J. Comput. Math., 6, 127-142 (1977) · Zbl 0358.68114 [6] Nivat, M., Infinite words, infinite trees, infinite computations, (Bakker, J. W.; van Leeuwen, J., Foundations of Computer Science, III.2 (1979), Mathematisch Centrum: Mathematisch Centrum Amsterdam), 3-52 · Zbl 0423.68012 [7] Rozenberg, G.; Salomaa, A., The Mathematical Theory of L Systems (1980), Academic Press: Academic Press New York · Zbl 0365.68072 [8] Salomaa, A., Formal Languages (1973), Academic Press: Academic Press New York · Zbl 0262.68025 [9] Salomaa, A., Comparative decision problems between sequential and parallel rewriting, Proc. Symposium Uniformly Structured Automata and Logic, 62-66 (1975), Tokyo [10] Salomaa, A., Morphisms of free monoids and language theory, (Proc. Conference on Formal Languages (December 1979), Academic Press: Academic Press New York), in Santa Barbara [11] Salomaa, A., Jewels of Formal Language Theory (1981), Computer Science Press · Zbl 0487.68063 [12] Thue, A., Uber unendliche Zeichenreihen, Videnskapsselsk. Skrifter Kristiania, 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.