Automata on words: (Extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2759, Issue , 2003, Pages 3-10

  Karhumäki, Juhani ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 26844530084     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45089-0_2     Document Type: Article

References (17)

1. J. Berstel, Trunsductions and Context-Free Languages, Teubner, 1979.
2. J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985.
3. J. Cassaigne, T. Harju, and J. Karhumäki, On the undecidability of freeness of matrix semigroups, Intern. J. Alg. & Comp. 9, 295-305, 1999.
4. C. Choffrut, T. Harju, and J. Karhumäki, A note on decidability questions on presentations of word semigroups, Theoret. Comput. Sci. 183, 83-92, 1997.
5. C. Choffrut and J. Karhum̈ki, Combinatorics of words, In: A. Salomaa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 1, 329-438. Springer-Verlag, 1997.
6. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.
7. A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, 1999.
8. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.
9. J. Karhumäki, A. Lepistö, and W. Plandowski, Locally periodic infinite words and a chaotic behaviour, J. Comb. Theor., Ser. A 100, 250-264, 2002.
10. A. Lepistö, On Relations between Local and Global Periodicity, Ph.D. Thesis, University of Turku, TUCS Dissertations 43, 2002.
11. M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics 17, Addison-Wesley, 1983.
12. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997.
13. M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics 90, Cambridge University Press, 2002.
14. J. Karhumäki, Applications of finite automata, Invited talk of MFCS02, LNCS 2420, 40-58, Springer-Verlag, 2002.
15. F. Mignosi, A. Restivo, and S. Salemi, A periodicity theorem on words and applications, In: J. Wiedermann and P. Hajek (Eds.), Mathematical Foundations of Computer Science 1995, LNCS 969, 337-348, Springer-Verlag, 1995.
16. F. Mignosi, A. Restivo, and S. Salemi, Periodicity and golden ratio, Theoret. Comput. Sci. 204, 153-167, 1998.
17. A. Restivo and C. Reutenauer, Some applications of a theorem of Shirshov to language theory, Information and Control 57, 205-213, 1983.