Advertisement

Automata on Words

Extended Abstract
  • Juhani Karhumäki
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2759)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Be79]
    J. Berstel, Transductions and Context-Free Languages, Teubner, 1979.Google Scholar
  2. [BP85]
    J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985.Google Scholar
  3. [CHK99]
    J. Cassaigne, T. Harju, and J. Karhumäki, On the undecidability of freeness of matrix semigroups, Intern. J. Alg. & Comp. 9, 295–305, 1999.zbMATHCrossRefGoogle Scholar
  4. [CHK97]
    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.zbMATHCrossRefMathSciNetGoogle Scholar
  5. [CK97]
    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.Google Scholar
  6. [CR94]
    M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.Google Scholar
  7. [dLV99]
    A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, 1999.Google Scholar
  8. [HU79]
    J. E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.Google Scholar
  9. [KLP02]
    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.zbMATHCrossRefGoogle Scholar
  10. [Le02]
    A. Lepistö, On Relations between Local and Global Periodicity, Ph.D. Thesis, University of Turku, TUCS Dissertations 43, 2002.Google Scholar
  11. [Lo83]
    M. Lothaire, Combinatorics on Words, Encyclopedia of Mathematics 17, Addison-Wesley, 1983. Reprinted in the Cambridge Mathematical Library, Cambridge University Press, 1997.Google Scholar
  12. [Lo02]
    M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics 90, Cambridge University Press, 2002.Google Scholar
  13. [K02]
    J. Karhumäki, Applications of finite automata, Invited talk of MFCS02, LNCS 2420, 40–58, Springer-Verlag, 2002.Google Scholar
  14. [MRS95]
    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.Google Scholar
  15. [MRS98]
    F. Mignosi, A. Restivo, and S. Salemi, Periodicity and golden ratio, Theoret. Comput. Sci. 204, 153–167, 1998.zbMATHCrossRefMathSciNetGoogle Scholar
  16. [RR83]
    A. Restivo and C. Reutenauer, Some applications of a theorem of Shirshov to language theory, Information and Control 57, 205–213, 1983.zbMATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Juhani Karhumäki
    • 1
  1. 1.Department of Mathematics and TUCSUniversity of TurkuTurkuFinland

Personalised recommendations