no. 4-6
Associative closure and periodicity of ω-words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 153-174 
@article{ITA_1998__32_4-6_153_0,
     author = {Mateescu, A. and Mateescu, G. D.},
     title = {Associative closure and periodicity of $\omega $-words},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {153--174},
     year = {1998},
     publisher = {EDP Sciences},
     volume = {32},
     number = {4-6},
     mrnumber = {1672723},
     language = {en},
     url = {https://www.numdam.org/item/ITA_1998__32_4-6_153_0/}
}
TY  - JOUR
AU  - Mateescu, A.
AU  - Mateescu, G. D.
TI  - Associative closure and periodicity of $\omega $-words
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1998
SP  - 153
EP  - 174
VL  - 32
IS  - 4-6
PB  - EDP Sciences
UR  - https://www.numdam.org/item/ITA_1998__32_4-6_153_0/
LA  - en
ID  - ITA_1998__32_4-6_153_0
ER  - 
%0 Journal Article
%A Mateescu, A.
%A Mateescu, G. D.
%T Associative closure and periodicity of $\omega $-words
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1998
%P 153-174
%V 32
%N 4-6
%I EDP Sciences
%U https://www.numdam.org/item/ITA_1998__32_4-6_153_0/
%G en
%F ITA_1998__32_4-6_153_0
Mateescu, A.; Mateescu, G. D. Associative closure and periodicity of $\omega $-words. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 32 (1998) no. 4-6, pp. 153-174. https://www.numdam.org/item/ITA_1998__32_4-6_153_0/

1. J. Berstel Recent Results on Sturmian Words, in Developments in Language Theory J. Dassow, G. Rozenberg and A. Salomaa, eds. World Scientific, 1996, pp. 13-24. | Zbl | MR

2. O. Carton, Mots Infinis, ω-Semigroupes et Topologie, thèse, Université Paris 7, 1993.

3. P. M. Cohn, Universal Algebra, NewYork, Harper and Row, 1965. | Zbl | MR

4. J. S. Golan,, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992. | Zbl | MR

5. W. Kuich and A. Salomaa, Semirings, Automata, Languages, EATCS Monographson Theoretical Computer Science, Springer-Verlag, Berlin, 1986. | Zbl | MR

6. M. Lothaire, Combinatorics on Words, Addison Wesley, vol. 17, Enciclopedia of Mathematics and its Applications, 1983. | Zbl | MR

7. A. De Luca, Sturmian words: new combinatorial resultsin Semigroups, Automata and Languages, J. Almeida, G.M.S. Gomes and P.V. Silva, eds.World Scientific, 1996, pp. 67-84. | Zbl | MR

8. A. Mateescu and G. D. Mateescu, "Associative shuffle of infinite words", TUCS Technical Report, 104, 1997.

9. A. Mw, G. Rozenberg and A. Salomaa, "Shuffle on Trajectories: Syntactic Constraints", Theoretical Computer Science, TCS, Fundamental Study, 1997, 197, (1-2), pp.1-56. | Zbl | MR

10. F. Mignosi, A. Restivo and S. Salemi, "A Periodicity Theorem on Words and Applications", Proceedings of MFCS 1995, J. Wiedermannand, P. Hájek, eds. LNCS 969, Springer-Verlag, 1995, pp. 337-348. | Zbl | MR

11. D. Park, "Concurrency and automata on infinitesequences", in Theoretical Computer Science, P. Deussen, eds. LNCS 104, Springer-Verlag, 1981, pp. 167-183. | Zbl

12. D. Perrin and J. E. Pin, Mots Infinis, Report LITP 93.40, 1993.

13. A. Salomaa, "Formal Languages", Academic Press, 1973. | Zbl | MR

14. L. Staiger, " ω-Languages", in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, eds. Springer, 1997, 3, pp. 339-388. | MR

15. W. Thomas, " Automata on Infinite Objects", in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen, eds. Elsevier, 1990, pp. 135-191. | Zbl | MR