Frontiers of infinite trees

Bruno Courcelle

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1978)

  • Volume: 12, Issue: 4, page 319-337
  • ISSN: 0988-3754

How to cite

top

Courcelle, Bruno. "Frontiers of infinite trees." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 12.4 (1978): 319-337. <http://eudml.org/doc/92084>.

@article{Courcelle1978,
author = {Courcelle, Bruno},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {infinite words; initial object in the category of all solutions; frontiers of infinite trees; derivation trees of context-free grammars; word equations},
language = {eng},
number = {4},
pages = {319-337},
publisher = {EDP-Sciences},
title = {Frontiers of infinite trees},
url = {http://eudml.org/doc/92084},
volume = {12},
year = {1978},
}

TY - JOUR
AU - Courcelle, Bruno
TI - Frontiers of infinite trees
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1978
PB - EDP-Sciences
VL - 12
IS - 4
SP - 319
EP - 337
LA - eng
KW - infinite words; initial object in the category of all solutions; frontiers of infinite trees; derivation trees of context-free grammars; word equations
UR - http://eudml.org/doc/92084
ER -

References

top
  1. 1. B. COURCELLE, A Representation of Trees by Languages, Theoretical Computer Science Vol. 7, 1978, pp. 25-55. Zbl0428.68088MR495226
  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.33902MR213241
  6. 6. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, this journal, Vol. 11, 1977, pp. 311-327. Zbl0371.68025MR468353
  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.45101MR241168
  8. 8. J. W. THATCHER, Generalized Sequential Machines Maps, J. Comput. System Sci., Vol. 4, 1970, pp. 339-367. Zbl0198.03303MR302335

Citations in EuDML Documents

top
  1. M. Dauchet, E. Timmerman, Continuous monoids and yields of infinite trees
  2. Wolfgang Thomas, On frontiers of regular trees
  3. Stephen L. Bloom, Zoltán Ésik, Axiomatizing omega and omega-op powers of words
  4. Stephen L. Bloom, Zoltán Ésik, Axiomatizing omega and omega-op powers of words
  5. Stephan Heilbrunner, An algorithm for the solution of fixed-point equations for infinite words
  6. Véronique Bruyère, Olivier Carton, Géraud Sénizergues, Tree Automata and Automata on Linear Orderings
  7. B. Courcelle, Algebraic and Regular Trees

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.