Skip to main content
SpringerLink
Log in

A Short Introduction to Infinite Automata

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2001)

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

Included in the following conference series:

Abstract

Infinite automata are of interest not only in the verification of systems with infinite state spaces, but also as a natural (and so far underdeveloped) framework for the study of formal languages. In this survey, we discuss some basic types of infinite automata, which are based on the so-called prefix-recognizable, synchronized rational, and rational transition graphs, respectively. We present characterizations of these transition graphs (due to Muller/Schupp and to Caucal and students), mention results on their power to recognize languages, and discuss the status of central algorithmic problems (like reachability of given states, or decidability of the first-order theory).

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. K. Barthelmann, On equational simple graphs, Tech. Rep. 9, Universität Mainz, Institut für Informatik 1997.

    Google Scholar 

  2. A. Blumensath, Prefix-recognisable graphs and monadic second-order logic, Aachener Informatik-Berichte 2001-6, Dep. Of Computer Science, RWTHAachen 2001.

    Google Scholar 

  3. A. Blumensath, E. Grädel, Automatic structures, Proc. 15th IEEE Symp. Logic in Computer Science (2000), 51–62.

    Google Scholar 

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

    MATH  Google Scholar 

  5. O. Burkart, J. Esparza, More infinite results, Bull. EATCS 62 (1997), 138–159.

    MATH  Google Scholar 

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

    Google Scholar 

  7. J. R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundl. Math. 6 (1960), 66–92.

    Article  MATH  Google Scholar 

  8. J. R. Büchi, Regular canonical systems, Arch. Math. Logik u. Grundlagenforschung 6 (1964), 91–111.

    Article  MATH  Google Scholar 

  9. D. Caucal, On transition graphs having a decidable monadic theory, in: F. Meyer auf der Heide, B. Monien (Eds.), Proc. 23rd ICALP, LNCS 1099 (1996), Springer-Verlag 1996, pp. 194–205.

    Google Scholar 

  10. D. Caucal, On transition graphs ofTuring machines, in: M. Margenstern, Y. Rogozhin (Eds.), Proc. Conf. on Machines, Computation and Universality, LNCS 2055 (2001), Springer-Verlag 2001, pp. 177–189.

    Google Scholar 

  11. D. Caucal, T. Knapik, An internal presentation of regular graphs by prefixrecognizable graphs, Theory of Computing Systems 34 (2001), 299–336.

    MATH  MathSciNet  Google Scholar 

  12. E.M. Clarke, O. Grumberg, D. Peled, Model Checking, MIT Press 1999.

    Google Scholar 

  13. B. Courcelle, The monadic second-order logic of graphs II: Infinite graphs of bounded width, Math. Systems Theory 21 (1989), 187–221.

    Article  MATH  MathSciNet  Google Scholar 

  14. D.B.A. Epstein, J.W. Cannon, D.F. Holt, S. Levy, M.S. Paterson, W. Thurston, Word Processing in Groups, Jones and Barlett 1992.

    Google Scholar 

  15. S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press 1974.

    Google Scholar 

  16. C.C. Elgot, J. Mezei, On relations defined by generalized finite automata, IBM J. Res. Dev. 9 (1965), 47–68.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. Esparza, D. Hansel, P. Rossmanith, S. Schwoon, Efficient algorithms for model checking pushdown systems, Proc. CAV 2000, LNCS 1855 (2000), Springer-Verlag 2000, pp. 232–247.

    Google Scholar 

  18. J. Esparza, S. Schwoon, A BDD-based model checker for recursive programs, in: G. Berry et al. (Eds.), CAV 2001, LNCS 2102, Springer-Verlag 2001, pp. 324–336.

    Google Scholar 

  19. C. Frougny, J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theor. Comput. Sci. 108 (1993), 45–82.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  21. W. Kuich, A. Salomaa, Semirings, Automata, Languages, Springer 1986.

    Google Scholar 

  22. C. Löding, Model-checking infinite systems generated by ground tree rewriting, to appear in Proc. FOSSACS 2002, LNCS, Springer-Verlag 2002.

    Google Scholar 

  23. K. L. McMillan, Symbolic Model Checking, Kluwer Academic Publishers 1993.

    Google Scholar 

  24. C. Morvan, On rational graphs, in: J. Tiuryn (Ed.), Proc. FOSSACS 2000, LNCS 1784 (2000), Springer-Verlag, pp. 252–266.

    Google Scholar 

  25. C. Morvan, C. Stirling, Rational graphs trace context-sensitive languages, in:A. Pultr, J. Sgall (Eds.), Proc. MFCS 2001, LNCS 2136, Springer-Verlag 2001, pp. 548–559

    Google Scholar 

  26. D. Muller, P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci. 37 (1985), 51–75.

    Article  MATH  MathSciNet  Google Scholar 

  27. M. Penttonen, One-sided and two-sided context in formal grammars, Inform. Contr. 25 (1974), 371–392.

    Article  MathSciNet  MATH  Google Scholar 

  28. M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1–35.

    Article  MATH  MathSciNet  Google Scholar 

  29. C. Rispal, The synchronized graphs trace the context-sensitive languages, manuscript, IRISA, Rennes 2001.

    Google Scholar 

  30. W. Thomas, Languages, automata, and logic, in Handbook of Formal Language Theory (G. Rozenberg, A. Salomaa, Eds.), Vol 3, Springer-Verlag, Berlin 1997, pp. 389–455.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. RWTH Aachen, Lehrstuhl für Informatik VII, 52056, Aachen, Germany

    Wolfgang Thomas

Authors
  1. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Algebra und Computermathematik Abt. für Theoretische Informatik, Technische Universität Wien, Wiedner Hauptstraße 8-10, 1040, Wien, Austria

    Werner Kuich

  2. Department of Computer Science, Leiden University, P.O. Box 9512, 2300, RA Leiden, The Netherlands

    Grzegorz Rozenberg

  3. Turku Centre for Computer Science, Lemminkaisenkatu 14A, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Thomas, W. (2002). A Short Introduction to Infinite Automata. In: Kuich, W., Rozenberg, G., Salomaa, A. (eds) Developments in Language Theory. DLT 2001. Lecture Notes in Computer Science, vol 2295. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46011-X_10

Download citation

  • DOI: https://doi.org/10.1007/3-540-46011-X_10

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43453-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation