An algorithm for the solution of fixed-point equations for infinite words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) no. 2, pp. 131-141.
@article{ITA_1980__14_2_131_0,
     author = {Heilbrunner, Stephan},
     title = {An algorithm for the solution of fixed-point equations for infinite words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {131--141},
     publisher = {EDP-Sciences},
     volume = {14},
     number = {2},
     year = {1980},
     zbl = {0433.68062},
     mrnumber = {581673},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1980__14_2_131_0/}
}
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
DA  - 1980///
SP  - 131
EP  - 141
VL  - 14
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1980__14_2_131_0/
UR  - https://zbmath.org/?q=an%3A0433.68062
UR  - https://www.ams.org/mathscinet-getitem?mr=581673
LA  - en
ID  - ITA_1980__14_2_131_0
ER  - 
Heilbrunner, Stephan. An algorithm for the solution of fixed-point equations for infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 14 (1980) no. 2, pp. 131-141. http://archive.numdam.org/item/ITA_1980__14_2_131_0/

1. B. Courcelle, Frontiers of Infinite Trees, R.A.I.R.O., Informatique théorique, Vol. 12, 1978, pp. 319-337. | Numdam | MR 517634 | Zbl 0411.68065

2. A. Fraenkel, Y. Bar-Hillel, A. Levy and Van Dalen, Foundations of Set Theory, 2nd rev. edition, North-Holland Publ. Co., Amsterdam, 1973. | MR 345816 | Zbl 0248.02071

3. F. Hausdorff, Grundzüge einer Theorie der geordneten Mengen, Math. Annalen, Vol. 65, 1908, pp. 435-505. | JFM 39.0099.01 | MR 1511478

4. F. Hausdorff, Grundzüge der Mengenlehre, Leipzig, 1914. | JFM 45.0123.01

5. S. Heilbrunner, Gleichungssysterne für Zeichenreihen, Technische Universität München, Bericht, No. 7311, 1973.

6. S. Heilbrunner, Das Problem der »unendlichen Modi« in Algol 68, Lecture Notes in Computer Science, Vol. 26, 1975, pp. 131-139, Springer-Verlag. | MR 386328 | Zbl 0359.68035

7. R. Mcnaughton, , Testing and Generating Infinite Sequences by a Finite Automaton, Information and Control, Vol. 9, 1966, pp. 521-530. | MR 213241 | Zbl 0212.33902

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. | Numdam | MR 468353 | Zbl 0371.68025

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. | Numdam | MR 510641 | Zbl 0387.68050

10. W. Sierpinski, Cardinal and Ordinal Numbers, Warsaw, 1965. | MR 194339 | Zbl 0131.24801

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. | JFM 48.1121.01