EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 32 / No 4-6 (1998) RAIRO-Theor. Inf. Appl., 32 4-6 (1998) 153-174 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 32, Number 4-6, 1998
Page(s) 153 - 174
DOI https://doi.org/10.1051/ita/1998324-601531
Published online 01 February 2017
  1. 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. [MR: 1466181] [Zbl: 1096.68689] [Google Scholar]
  2. 2. O. CARTON, Mots Infinis, ω-Semigroupes et Topologie, thèse, Université Paris 7, 1993. [Google Scholar]
  3. 3. P. M. COHN, Universal Algebra, NewYork, Harper and Row, 1965. [MR: 175948] [Zbl: 0141.01002] [Google Scholar]
  4. 4. J. S. GOLAN,, The Theory of Semirings with Applications in Mathematics and Theoretical Computer Science, Longman Scientific and Technical, Harlow, Essex, 1992. [MR: 1163371] [Zbl: 0780.16036] [Google Scholar]
  5. 5. W. KUICH and A. SALOMAA, Semirings, Automata, Languages, EATCS Monographson Theoretical Computer Science, Springer-Verlag, Berlin, 1986. [MR: 817983] [Zbl: 0582.68002] [Google Scholar]
  6. 6. M. LOTHAIRE, Combinatorics on Words, Addison Wesley, vol. 17, Enciclopedia of Mathematics and its Applications, 1983. [MR: 675953] [Zbl: 0514.20045] [Google Scholar]
  7. 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. [MR: 1477723] [Zbl: 0917.20042] [Google Scholar]
  8. 8. A. MATEESCU and G. D. MATEESCU, "Associative shuffle of infinite words", TUCS Technical Report, 104, 1997. [Zbl: 0884.68071] [Google Scholar]
  9. 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. [MR: 1615787] [Zbl: 0902.68096] [Google Scholar]
  10. 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. [MR: 1467268] [Zbl: 1193.68202] [Google Scholar]
  11. 11. D. PARK, "Concurrency and automata on infinitesequences", in Theoretical Computer Science, P. Deussen, eds. LNCS 104, Springer-Verlag, 1981, pp. 167-183. [Zbl: 0457.68049] [Google Scholar]
  12. 12. D. PERRIN and J. E. PIN, Mots Infinis, Report LITP 93.40, 1993. [Google Scholar]
  13. 13. A. SALOMAA, "Formal Languages", Academic Press, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
  14. 14. L. STAIGER, " ω-Languages", in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, eds. Springer, 1997, 3, pp. 339-388. [MR: 1470023] [Google Scholar]
  15. 15. W. THOMAS, " Automata on Infinite Objects", in Handbook of Theoretical Computer Science, Volume B, J. van Leeuwen, eds. Elsevier, 1990, pp. 135-191. [MR: 1127189] [Zbl: 0900.68316] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.