Languages obtained from infinite words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 5, pp. 445-455. 
@article{ITA_1997__31_5_445_0,
     author = {Harju, T. and Ilie, L.},
     title = {Languages obtained from infinite words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {445--455},
     publisher = {EDP-Sciences},
     volume = {31},
     number = {5},
     year = {1997},
     mrnumber = {1611655},
     zbl = {0903.68115},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1997__31_5_445_0/}
}
TY  - JOUR
AU  - Harju, T.
AU  - Ilie, L.
TI  - Languages obtained from infinite words
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1997
SP  - 445
EP  - 455
VL  - 31
IS  - 5
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1997__31_5_445_0/
LA  - en
ID  - ITA_1997__31_5_445_0
ER  - 
%0 Journal Article
%A Harju, T.
%A Ilie, L.
%T Languages obtained from infinite words
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1997
%P 445-455
%V 31
%N 5
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1997__31_5_445_0/
%G en
%F ITA_1997__31_5_445_0
Harju, T.; Ilie, L. Languages obtained from infinite words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 31 (1997) no. 5, pp. 445-455. http://archive.numdam.org/item/ITA_1997__31_5_445_0/

[AuGa] J.-M. Autebert and J. Gabarro, Iterated GSM's and Co-CFL, Acta Informatica, 1989, 26, pp. 749-769. | MR | Zbl

[AFG] J.-M. Autebert, P. Flajolet and J. Gabarro, Prefixes of infinite words and ambiguous context-free languages, Inf. Process. Lett, 1987, 25, pp. 211-216. | MR | Zbl

[Bea1] D. Beauquier, Thin homogeneous sets of factors, Proc. of the 6th Conference of Foundations of Software Technology and Theoret. Comput. Sci., Lecture Notes in Computer Science 241, 1986, pp. 239-251. | MR | Zbl

[Bea2] D. Beauquier, Minimal automaton of a rational cover, Proc. ICALP'87, Lecture Notes in Computer Science 267, 1987, pp. 174-189. | MR | Zbl

[BeaN] D. Beauquier and M. Nivat, About rational sets of factors of a bi-infinite word, Proc. ICALP'85, Lecture Notes in Computer Science 194, 1985, pp. 33-42. | MR | Zbl

[Ber] J. Berstel, Every iterated morphism yields a Co-CFL, Inf. Process. Lett., 1986, 22, pp. 7-9. | MR | Zbl

[BoNi] L. Boasson and M. Nivat, Adherence of languages, J. Comput. Syst. Sci., 1980, 20, pp. 285-309. | MR | Zbl

[Ei]S. Eilenberg, Automata, Languages and Machines, Vol. 1, Academic Press, New York, 1974. | MR | Zbl

[HoUl] J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Mass., 1979. | MR | Zbl

[Lo] M. Lothaire, Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983. | MR | Zbl

[MaPa1] S. Marcus and Gh. Păun, Infinite (almost periodic) words, formal languages and dynamical systems, The Bulletin of the EATCS, 1994, 54, pp. 224-231. | Zbl

[MaPa2] S. Marcus and Gh. Păun, Infinite words and their associated formal language, in: C. Calude, M. J. J. Lennon, H. Maurer (eds.), Salodays in Auckland (Auckland Univ. Press, 1994), pp. 95-99. | Zbl

[Sa] A. Salomaa, Formal Languages, Academic Press, New York, 1973. | MR | Zbl