Associative closure and periodicity of -words
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1998)
- Volume: 32, Issue: 4-6, page 153-174
- ISSN: 0988-3754
Access Full Article
top
How to cite
topMateescu, A., and Mateescu, G. D.. "Associative closure and periodicity of $\omega $-words." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 32.4-6 (1998): 153-174. <http://eudml.org/doc/92584>.
@article{Mateescu1998,
author = {Mateescu, A., Mateescu, G. D.},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {shuffle on trajectories},
language = {eng},
number = {4-6},
pages = {153-174},
publisher = {EDP-Sciences},
title = {Associative closure and periodicity of $\omega $-words},
url = {http://eudml.org/doc/92584},
volume = {32},
year = {1998},
}
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
PB - EDP-Sciences
VL - 32
IS - 4-6
SP - 153
EP - 174
LA - eng
KW - shuffle on trajectories
UR - http://eudml.org/doc/92584
ER -
References
top- 1. J. BERSTELRecent Results on Sturmian Words, in Developments in Language Theory J. Dassow, G. Rozenberg and A. Salomaa, eds. World Scientific, 1996, pp. 13-24. Zbl1096.68689MR1466181
- 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. Zbl0141.01002MR175948
- 4. J. S. GOLAN,, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992. Zbl0780.16036MR1163371
- 5. W. KUICH and A. SALOMAA, Semirings, Automata, Languages, EATCS Monographson Theoretical Computer Science, Springer-Verlag, Berlin, 1986. Zbl0582.68002MR817983
- 6. M. LOTHAIRE, Combinatorics on Words, Addison Wesley, vol. 17, Enciclopedia of Mathematics and its Applications, 1983. Zbl0514.20045MR675953
- 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. Zbl0917.20042MR1477723
- 8. A. MATEESCU and G. D. MATEESCU, "Associative shuffle of infinite words", TUCS Technical Report, 104, 1997. Zbl0884.68071
- 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. Zbl0902.68096MR1615787
- 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. Zbl1193.68202MR1467268
- 11. D. PARK, "Concurrency and automata on infinitesequences", in Theoretical Computer Science, P. Deussen, eds. LNCS 104, Springer-Verlag, 1981, pp. 167-183. Zbl0457.68049
- 12. D. PERRIN and J. E. PIN, Mots Infinis, Report LITP 93.40, 1993.
- 13. A. SALOMAA, "Formal Languages", Academic Press, 1973. Zbl0262.68025MR438755
- 14. L. STAIGER, " ω-Languages", in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, eds. Springer, 1997, 3, pp. 339-388. MR1470023
- 15. W. THOMAS, " Automata on Infinite Objects", in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen, eds. Elsevier, 1990, pp. 135-191. Zbl0900.68316MR1127189
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.