Skip to main content
SpringerLink
Log in

Automata on Words

Extended Abstract

  • Conference paper
  • First Online:
Book cover Implementation and Application of Automata (CIAA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2759))

Included in the following conference series:

Supported by the Academy of Finland under the grants 44087 and 202251.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and Context-Free Languages, Teubner, 1979.

    Google Scholar 

  2. J. Berstel and D. Perrin, Theory of Codes, Academic Press, 1985.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Google Scholar 

  6. M. Crochemore and W. Rytter, Text Algorithms, Oxford University Press, 1994.

    Google Scholar 

  7. A. de Luca and S. Varricchio, Finiteness and Regularity in Semigroups and Formal Languages, Springer-Verlag, 1999.

    Google Scholar 

  8. J. E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979.

    Google Scholar 

  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.

    Article  MATH  Google Scholar 

  10. A. Lepistö, On Relations between Local and Global Periodicity, Ph.D. Thesis, University of Turku, TUCS Dissertations 43, 2002.

    Google Scholar 

  11. 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. M. Lothaire, Algebraic Combinatorics on Words. Encyclopedia of Mathematics 90, Cambridge University Press, 2002.

    Google Scholar 

  13. J. Karhumäki, Applications of finite automata, Invited talk of MFCS02, LNCS 2420, 40–58, Springer-Verlag, 2002.

    Google Scholar 

  14. 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. F. Mignosi, A. Restivo, and S. Salemi, Periodicity and golden ratio, Theoret. Comput. Sci. 204, 153–167, 1998.

    Article  MATH  MathSciNet  Google Scholar 

  16. A. Restivo and C. Reutenauer, Some applications of a theorem of Shirshov to language theory, Information and Control 57, 205–213, 1983.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and TUCS, University of Turku, 20014, Turku, Finland

    Juhani Karhumäki

Authors
  1. Juhani Karhumäki
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, CA, 93106, USA

    Oscar H. Ibarra

  2. School of Electrical Engineering and Computer Science, Washington State University, Pullman, WA, 99163, USA

    Zhe Dang

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J. (2003). Automata on Words. In: Ibarra, O.H., Dang, Z. (eds) Implementation and Application of Automata. CIAA 2003. Lecture Notes in Computer Science, vol 2759. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45089-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-45089-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40561-0

  • Online ISBN: 978-3-540-45089-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation