An algorithm for the solution of fixed-point equations for infinite words

Stephan Heilbrunner

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

  • Volume: 14, Issue: 2, page 131-141
  • ISSN: 0988-3754

How to cite

top

Heilbrunner, Stephan. "An algorithm for the solution of fixed-point equations for infinite words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 14.2 (1980): 131-141. <http://eudml.org/doc/92120>.

@article{Heilbrunner1980,
author = {Heilbrunner, Stephan},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {fixed-point equations; algorithm; shuffle operation; frontiers of infinite trees; context-free grammars},
language = {eng},
number = {2},
pages = {131-141},
publisher = {EDP-Sciences},
title = {An algorithm for the solution of fixed-point equations for infinite words},
url = {http://eudml.org/doc/92120},
volume = {14},
year = {1980},
}

TY - JOUR
AU - Heilbrunner, Stephan
TI - An algorithm for the solution of fixed-point equations for infinite words
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1980
PB - EDP-Sciences
VL - 14
IS - 2
SP - 131
EP - 141
LA - eng
KW - fixed-point equations; algorithm; shuffle operation; frontiers of infinite trees; context-free grammars
UR - http://eudml.org/doc/92120
ER -

References

top
  1. 1. B. COURCELLE, Frontiers of Infinite Trees, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp. 319-337. Zbl0411.68065MR517634
  2. 2. A. FRAENKEL, Y. BAR-HILLEL, A. LEVY and VAN DALEN, Foundations of Set Theory, 2nd rev. edition, North-Holland Publ. Co., Amsterdam, 1973. Zbl0248.02071MR345816
  3. 3. F. HAUSDORFF, Grundzüge einer Theorie der geordneten Mengen, Math. Annalen, Vol. 65, 1908, pp. 435-505. MR1511478JFM39.0099.01
  4. 4. F. HAUSDORFF, Grundzüge der Mengenlehre, Leipzig, 1914. JFM45.0123.01
  5. 5. S. HEILBRUNNER, Gleichungssysterne für Zeichenreihen, Technische Universität München, Bericht, No. 7311, 1973. 
  6. 6. S. HEILBRUNNER, Das Problem der »unendlichen Modi« in Algol 68, Lecture Notes in Computer Science, Vol. 26, 1975, pp. 131-139, Springer-Verlag. Zbl0359.68035MR386328
  7. 7. R. MCNAUGHTON, , Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 521-530. Zbl0212.33902MR213241
  8. 8. M. NIVAT, Mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, Vol. 11, 1977, pp. 311-327. Zbl0371.68025MR468353
  9. 9. M. NIVAT, Sur les ensembles des mots infinis engendrés par une grammaire algébrique, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp. 259-278. Zbl0387.68050MR510641
  10. 10. W. SIERPINSKI, Cardinal and Ordinal Numbers, Warsaw, 1965. Zbl0131.24801MR194339
  11. 11. Th. SKOLEM, Logisch-kombinatorische Untersuchungen über die Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theoreme über dichte Mengen, Skrifter utgit av Videnskapselskapet i Kristiania, 1. Mathematisk-Naturvidenskabelig Klasse, 1. Bind, No. 4, 1920, p. 4-36. JFM48.1121.01

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.