Frontiers of infinite trees. (English) Zbl 0411.68065


68Q45 Formal languages and automata
18A30 Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.)
18B99 Special categories
Full Text: EuDML


[1] 1. B. COURCELLE, A Representation of Trees by Languages, Theoretical Computer Science Vol. 7, 1978, pp. 25-55. Zbl0428.68088 MR495226 · Zbl 0428.68088
[2] 2. B. COURCELLE and M. NIVAT, Algebraic Families of Interpretations, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 137-146. MR451817
[3] 3. S. HEILBRUNNER, Gleichungssysteme für Zeichenreihen, Technische Universität München, Bericht Nr. 7311, 1973.
[4] 4. D. LEHMANN, Categories for Fixpoint Semantics, 17th Symposium on Foundations of Computer Science, Houston, 1976, pp. 122-126. MR474955
[5] 5. R. MCNAUGHTON, Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 311-327. Zbl0212.33902 MR213241 · Zbl 0212.33902
[6] 6. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, this journal, Vol. 11, 1977, pp. 311-327. Zbl0371.68025 MR468353 · Zbl 0371.68025
[7] 7. M. NIVAT, Éléments de la théorie générale des Codes, in Automata Theory, E. R. CAIANIELLO, ed., Academic Press 1966, pp. 278-294. Zbl0208.45101 MR241168 · Zbl 0208.45101
[8] 8. J. W. THATCHER, Generalized Sequential Machines Maps, J. Comput. System Sci., Vol. 4, 1970, pp. 339-367. Zbl0198.03303 MR302335 · Zbl 0198.03303
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.