Rebootable and suffix-closed ω-power languages
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 1, pp. 45-58. 
@article{ITA_1992__26_1_45_0,
     author = {Le Sa\"ec, B. and Litovsky, I.},
     title = {Rebootable and suffix-closed $\omega $-power languages},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {45--58},
     publisher = {EDP-Sciences},
     volume = {26},
     number = {1},
     year = {1992},
     mrnumber = {1155344},
     zbl = {0768.68079},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1992__26_1_45_0/}
}
TY  - JOUR
AU  - Le Saëc, B.
AU  - Litovsky, I.
TI  - Rebootable and suffix-closed $\omega $-power languages
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1992
SP  - 45
EP  - 58
VL  - 26
IS  - 1
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1992__26_1_45_0/
LA  - en
ID  - ITA_1992__26_1_45_0
ER  - 
%0 Journal Article
%A Le Saëc, B.
%A Litovsky, I.
%T Rebootable and suffix-closed $\omega $-power languages
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1992
%P 45-58
%V 26
%N 1
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1992__26_1_45_0/
%G en
%F ITA_1992__26_1_45_0
Le Saëc, B.; Litovsky, I. Rebootable and suffix-closed $\omega $-power languages. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 26 (1992) no. 1, pp. 45-58. http://www.numdam.org/item/ITA_1992__26_1_45_0/

1. A. Arnold, A Syntactic Congruence for Rational ω-languages, Theoret Comput. Sci., 1985, 39, pp. 333-335. | MR | Zbl

2. A. Arnold and M. Nivat, Comportements de processus, Rapport interne, L.I.T.P., 1982, pp. 82-12.

3. J. Bertsel and D. Perrin, Theory of Codes, Academic Press, New York, 1985. | MR | Zbl

4. L. Boasson and M. Nivat, Adherences of Languages, J. Comput. System Sci., 1980, 20, pp. 285-309. | MR | Zbl

5. J. R. Büchi, On Decision Method in Restricted Second-Order Arithmetics, Proc. Congr. Logic, Method. and Phulos. Sci., Stanford Univ. Press, 1962, p. 1-11. | MR | Zbl

6. S. Eilenberg, Automata, Languages and Machines, A, Academic Press, New York, 1974. | MR

7. H. Jürgensen and G. Thierrin, On ω-languages Whose Syntactic Monoid is Trivial, J. Comput. Inform. Sci., 1983, 12, pp. 359-365. | MR | Zbl

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

9. M. Latteux and E. Timmeran, Finitely Generated ω-Languages, Inform Process. Lett., 1986, 23, pp. 171-175. | MR | Zbl

10. R. Linder and L. Staiger, Algebraische Codierungstheorie-Theorie der sequentiellen Codierungen, Akademie-Verlag, Berlin, 1977. | MR | Zbl

11. I. Litovsky, Générateurs des langages rationnels de mots infinis, Thèse, Univ. Lille-I, 1988.

12. I. Litovsky, and E. Timmerman, On Generators of Rational ω-Power Languages, Theoret. Comput. Sci., 1987, 53, pp. 187-200. | MR | Zbl

13. R. Macnaughton, Testing and Generating Infinite Sequences by a Finite Automaton, Inform. Control, 1966, 9, pp. 521-530. | MR | Zbl

14. L. Staiger, A Note on Connected ω-languages, Elektron. Inform. Kybernetik, 1980, 16, 5/6, pp. 245-251. | MR | Zbl

15. L. Staiger, Finite State ω-Languages, J. Comput. System Sci., 1983, 27, pp. 434-448. | MR | Zbl

16. L. Saiger, On Infinitary Finite Length Codes, Theore. Inform. Appli. 1986, 20, 4, pp. 483-494. | Numdam | MR | Zbl

17. L. Staiger, Research in the Theory of ω-Languages, Elektron. Inform. Kybernetik, 1987, 23, 8/9, pp. 415-439. | MR | Zbl