On frontiers of regular trees

Wolfgang Thomas

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

  • Volume: 20, Issue: 4, page 371-381
  • ISSN: 0988-3754

How to cite

top

Thomas, Wolfgang. "On frontiers of regular trees." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 20.4 (1986): 371-381. <http://eudml.org/doc/92265>.

@article{Thomas1986,
author = {Thomas, Wolfgang},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {generalized words; model theory of linear orderings; automata on infinite trees; equivalence of countable word- or order-types},
language = {eng},
number = {4},
pages = {371-381},
publisher = {EDP-Sciences},
title = {On frontiers of regular trees},
url = {http://eudml.org/doc/92265},
volume = {20},
year = {1986},
}

TY - JOUR
AU - Thomas, Wolfgang
TI - On frontiers of regular trees
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1986
PB - EDP-Sciences
VL - 20
IS - 4
SP - 371
EP - 381
LA - eng
KW - generalized words; model theory of linear orderings; automata on infinite trees; equivalence of countable word- or order-types
UR - http://eudml.org/doc/92265
ER -

References

top
  1. 1. B. COURCELLE, Frontiers of Infinite Trees, RAIRO Inform. Theor., Vol. 12, 1978, pp. 319-337. Zbl0411.68065MR517634
  2. 2. B. COURCELLE, Fundamental Properties of Infinite Trees, Theor. Comput. Sci., Vol. 25, 1983, pp. 95-169. Zbl0521.68013MR693076
  3. 3. M. DAUCHET and E. TIMMERMAN, Decidability of Yield's Equality for Infinite Regular Trees, in: Automata on Infinité Words, M. NIVAT and D. PERRIN Eds., Springer Lect. Notes in Comput. Sci., Vol. 192, 1984, pp. 118-136. Zbl0571.68067MR814738
  4. 4. S. HEILBRUNNER, Gleichungs systeme für Zeichenreihen, Technische Universität München, Abt. Math., Bericht Nr. 7311, 1973. 
  5. 5. S. HEILBRUNNER, An Algorithm for the Solution of Fixed-point Equations for Infinite Words, RAIRO Inform. Théor., Vol. 14, 1980, pp. 131-141. Zbl0433.68062MR581673
  6. 6. H. LÄUCHLI and J. LÉONARD, On the Elementary Theory of Linear Order, Fund. Math., Vol. 59, 1966, pp. 109-116. Zbl0156.25301MR199108
  7. 7. M. O. RABIN, Decidability of Second-order Theories and Automata on Infinite Trees, Trans. Amer. Math. Soc., Vol. 141, 1969, pp. 1-35. Zbl0221.02031MR246760
  8. 8. M. O. RABIN, Automata on Infinite Objects and Church's Problem, Reg. Conf. Ser. in Math. No 13, Amer. Math. Soc., Providence, R.I., 1972. Zbl0315.02037MR321708
  9. 9. J. G. ROSENSTEIN, Linear Orderings, Academic Press, New York, 1982. Zbl0488.04002MR662564
  10. 10. S. SHELAH, The Monadic Theory of Order, Ann. Math., Vol. 102, 1975, pp. 379-419. Zbl0345.02034MR491120
  11. 11. E. TIMMERMAN, Yields of Infinite Trees, in: Ninth Colloquium on Trees in Algebra and Programming, B. COURCELLE Ed, Cambridge Univ. Press, 1984, pp. 299-312. Zbl0554.68051MR787468
  12. 12. M. DAUCHET and E. TIMMERMAN, RAIRO Inform. Theor. (to appear). 

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.