no. 2
Sequential mappings of ω-languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 2, pp. 147-173. 
@article{ITA_1987__21_2_147_0,
     author = {Staiger, Ludwig},
     title = {Sequential mappings of $\omega $-languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {147--173},
     publisher = {EDP-Sciences},
     volume = {21},
     number = {2},
     year = {1987},
     mrnumber = {894708},
     zbl = {0634.68070},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1987__21_2_147_0/}
}
TY  - JOUR
AU  - Staiger, Ludwig
TI  - Sequential mappings of $\omega $-languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1987
SP  - 147
EP  - 173
VL  - 21
IS  - 2
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1987__21_2_147_0/
LA  - en
ID  - ITA_1987__21_2_147_0
ER  - 
%0 Journal Article
%A Staiger, Ludwig
%T Sequential mappings of $\omega $-languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1987
%P 147-173
%V 21
%N 2
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1987__21_2_147_0/
%G en
%F ITA_1987__21_2_147_0
Staiger, Ludwig. Sequential mappings of $\omega $-languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) no. 2, pp. 147-173. http://archive.numdam.org/item/ITA_1987__21_2_147_0/

[Au] J.-M. Autebert, Relationships Between AFDLs and Cylinders, Techn. Rep. No. 78-53, L.I.T.P., Paris, 1978.

[BN] L. Boasson and M. Nivat, Adherences of Languages, J. Comput. Syst. Sci., Vol. 20, No. 3, 1980, p. 285-309. | MR | Zbl

[Bü] J. R. Büchi, On a Decision Method in Restricted Second Order Arithmetic, in Proceedings 1960Int. Congr. for Logic, Stanford Univ. Press, Stanford, 1962, pp. 1-11. | MR | Zbl

[CG] R. S. Cohen and A. Y. Gold, ω-Computations on Turing Machines, Theoret. Comput. Sci., Vol. 6, 1978, pp. 1-23. | MR | Zbl

[Da] M. Davis, Infinitary Games of Perfect Information, in Advances in Game Theory, Princeton Univ. Press, Princeton N. J., 1964, pp. 89-101. | MR | Zbl

[Ku] K. Kuratowskj, , Topology I, Academic Press, New York, 1966. | MR | Zbl

[La] L. H. Landweber, Decision Problems for ω-Automata, Math. Syst. Theory, Vol. 3, 1969, pp. 376-384. | MR | Zbl

[LS] R. Lindner and L. Staiger., Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977. | MR | Zbl

[Sc 1] C. P. Schnorr, Zufälligkeit und Wahrscheinlichkeit, L.N.M. 218, Springer-Verlag, Berlin-Heidelberg-New York, 1971. | MR | Zbl

[Sc 2] C. P. Schnorr, Process Complexity and Effective Random Tests, J. Comput. Syst. Sci., Vol. 7, No. 4, 1973, pp. 376-388. | MR | Zbl

[St 1] L. Staiger, Über ein Analogon des Satzes von Ginsburg-Rose für sequentielle Folgenoperatoren und reguläre Folgenmengen, Dipl. Arbeit, Friedrich-Schiller-Universität, Jena 1970.

[St 2] L. Staiger, Zur Topologie der regularen Mengen, Diss. A, Friedrich-Schiller-Universtität, Jena 1976.

[St 3] L. Staiger, Projection Lemmas for ω-Languages, Theoret Comput. Sci., Vol. 32, 1984, pp. 331-337. | MR | Zbl

[St 4] L. Staiger, Hierarchies of Recursive ω-Languages, E.I.K.-J. Inform. Process and Cybernetics, Vol. 22, No. 5/6, 1986, pp. 219-241. | MR | Zbl

[SW 1] L. Staiger and K. Wagner, Zur Theorie der abstrakten Familien von ω-Sprachen (ω-AFL), in Algorithm. Kompliziertheit, Lern - und Erkennungsprozesse, Jena 1976, pp. 79-91. | MR | Zbl

[SW 2] L. Staiger and K. Wagner, Rekursive Folgenmengen I, Zeitschr. Math. Logik u. Grundl. Math., Vol. 24, 1978, pp. 523-538. | MR | Zbl

[Wa 1] K. Wagner, Arithmetische Operatoren, Zeitschr. Math. Logik u. Grundl. Math., Vol. 22, 1976, pp. 553-570. | MR | Zbl

[Wa 2] K. Wagner, On ω-Regular Sets, Inform. Control., Vol. 43, 1979, pp. 123-177. | MR | Zbl