Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Mathematical Foundations of Computer Science

MFCS 2002: Mathematical Foundations of Computer Science 2002 pp 40–58Cite as

Applications of Finite Automata

  • Conference paper
  • First Online:

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

Abstract

We consider three different recent applications of finite automata. They are chosen to emphasize the diversified applicapity of the theory.

Supported under the grant 44087 of the Academy of Finland

This is a preview of subscription content, 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   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, R. Sethi, and J.D. Ullman, Compilers: Principles, Techniques, and Tools, Addison-Wesley, 1986.

    Google Scholar 

  2. M.F. Barnsley, Fractals Everywhere, Academic Press, New York, 1988.

    MATH  Google Scholar 

  3. R. Berger, The undecidability of the domino problem, Mem. Amer. Math. Soc. 66, 1966.

    Google Scholar 

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

    Google Scholar 

  5. J. Berstel and M. Morcrette, Compact representation of patterns by finite automata, Proceedings Pixim’89 Paris, 387–402, 1998.

    Google Scholar 

  6. S. Beatty, Problem 3173, Amer. Math. Monthly 33, 159, 1926, solution in 34, 159, 1927.

    Article  MathSciNet  Google Scholar 

  7. A. Bouajjani, Languages, rewriting systems, and verification of infinite-state systems, in: F. Orejas et al. (eds.), Proc. ICALP 2001,Springer LNCS 2076, 24–39, Springer-Verlag, 2001.

    Google Scholar 

  8. O. Burkart, D. Caucal, F. Moller, and B. Steffen, Verification over Infinite States, in: J. Bergstra, A. Ponse, and S.A. Smolka (eds.), Handbook of Process Algebra, 545–623, Elsevier Publishers, 2001.

    Google Scholar 

  9. J. Brzozowski, Open problems about regular languages, in: R.V. Book (ed.), Formal language theory-Perspectives and open problems, Academic Press, New York, 1980

    Google Scholar 

  10. J. Cassaigne, T. Harju, and J. Karhumäki, On the undecidability of free-ness of matrix semigroups, Inter. J. Alg. and Comput. 9, 295–305, 1999.

    Article  MATH  Google Scholar 

  11. 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 

  12. C. Choffrut and J. Karhumäki, Combinatorics of Words, in: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, Vol. 1, Springer, 329–438, 1997.

    Google Scholar 

  13. M. Crochemore, F. Mignosi, A. Restivo, and S. Salemi, Text compression using anti-dictionaries, Springer LNCS 1644, 261–270, 1999.

    Google Scholar 

  14. K. Culik II, An aperiodic set of 13 tiles, Discr. Math. 160, 245–251, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  15. K. Culik II and J. Karhumäki, Finite automata computing real functions, SIAM J. Comput. 23, 789–814, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  16. K. Culik II and J. Kari, Image compression using weighted finite automata, Computer and Graphics 13, 305–313, 1993.

    Article  Google Scholar 

  17. K. Culik II and J. Kari, Digital Images and Formal Languages, in: A. Salomaa and G. Rozenberg (eds.), Handbook of Formal Languages, Vol. 3, 599–616, Springer-Verlag, 1997.

    Google Scholar 

  18. K. Culik II and I. Fris, Weighted finite transducers in image processing, Discr. Appl. Math. 58, 223–237, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  19. D. Derencourt, J. Karhumäki, M. Latteux, and A. Terlutte, On continuous functions computed by finite automata, Theor. Inform. and Appl. 28, 387–403, 1994.

    MATH  Google Scholar 

  20. D. Derencourt, J. Karhumäki, M. Latteux, and A. Terlutte, On the computational power of weighted finite automata, Fundamenta Informaticae 25, 285–293, 1996.

    MATH  MathSciNet  Google Scholar 

  21. S. Dube and K. Culik II, Affine automata and related techniques for generating complex images, Proceedings of MFCS’90, Springer LNCS 452, 224–231, 1990.

    Google Scholar 

  22. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, New York, 1974.

    MATH  Google Scholar 

  23. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston, Word processing in groups, Jones and Bartlett, Boston, 1992.

    MATH  Google Scholar 

  24. T. Harju and J. Karhumäki, The equivalence problem for multitape automata, Theoret. Comput. Sci. 78, 347–355, 1991.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  26. J. Kari, A small aperiodic set of Wang tiles, Discr. Math. 160, 259–264, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  27. O. Kharlampovich and M. Sapir, Algorithmic problems in varieties, Int. J. Alg. and Comput. 5, 379–602, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  28. D. Klarner, J.C. Birget, W. Satterfield, On the undecidability of the free-ness of integer matrix semigroups, Int. J. Alg. and Comput. 1, 223–226, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  29. S. Kleene, Representation of events in nerve nets and finite automata, in: C.E. Shannon and J. McCarthy (eds.), Automata Studies, Princeton University Press, 3–42, 1956.

    Google Scholar 

  30. M. Lothaire, Algebraic Combinatorics on Words, Encyclopedia of Mathematics and its Applications 90, Cambridge University Press, 2002.

    Google Scholar 

  31. A.A. Markov, On the Impossibility of Certain Algorithm in the Theory of Associative Systems I+II(Russian), Doklady Akademii Nauk S.S.S.R.,n.s., vol. 55, 587–590, vol. 58, 353–356, 1947. English translation for I: Comptes rendus de l’acadêmie des sciences de l’U.R.S.S., n.s., vol. 55, 583–586, 1947.

    Google Scholar 

  32. S. Micali, Two-way deterministic finite automata are exponentially more succinct than sweeping automata. Inform. Proc. Letters 12(2), 103–105, 1981.

    Article  MATH  MathSciNet  Google Scholar 

  33. M. Mohri, Finite-State Transducers in Language and Speech Processing, Computational Linguistics 23(2), 269–311, 1997.

    MathSciNet  Google Scholar 

  34. E. Post, Recursive unsolvability of a problem of Thue, J. Symbolic Logic 12, 1–11, 1947.

    Article  MathSciNet  Google Scholar 

  35. M. Rabin and D. Scott, Finite Automata and their decision problems, IBM J. Res. 3, 115–125, 1959.

    MathSciNet  Google Scholar 

  36. A. Salomaa and M. Soittola, Automata-Theoretic Aspects of Formal Power Series, Springer, 1978.

    Google Scholar 

  37. G. Senizergues, L(A)=L(B)? decidability results from formal systems, Theoret. Comput. Sci. 251, 1–166, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  38. W. Thomas, Automata on infinite objects, in: J. van Leeuwen (eds.), Handbook of Theoretical Computer Science, Vol. B, 135–191, Elsevier, The MIT Press, 1990.

    Google Scholar 

  39. M. Vardi, Nontraditional Applications of Automata Theory, TACS’94, Springer LNCS 789, 575–597, Springer-Verlag, 1994.

    Google Scholar 

  40. S. Yu, Regular languages, in: G. Rozenberg and A. Salomaa (eds.), Handbook of Formal Languages, 41–110, Springer, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics & TUCS, University of Turku, FIN-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. Institute of Informatics, Warsaw University, ul. Banacha 2, 02-097, Warszawa, Poland

    Krzysztof Diks  & Wojciech Rytter  & 

  2. Department of Computer Science, Liverpool University, Peach Street, Liverpool, L69 7ZF, UK

    Wojciech Rytter

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Karhumäki, J. (2002). Applications of Finite Automata. In: Diks, K., Rytter, W. (eds) Mathematical Foundations of Computer Science 2002. MFCS 2002. Lecture Notes in Computer Science, vol 2420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45687-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45687-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-44040-6

  • Online ISBN: 978-3-540-45687-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation