A short introduction to infinite automata

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

Volumn 2295 LNCS, Issue , 2002, Pages 130-144

  Thomas, Wolfgang ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMIC LANGUAGES; AUTOMATA THEORY; FORMAL LANGUAGES;

ALGORITHMIC PROBLEMS; FIRST ORDER THEORIES; INFINITE STATE SPACE; REACHABILITY; TRANSITION GRAPHS;

AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS;

EID: 84876935358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46011-x_10     Document Type: Conference Paper

References (30)

1. K. Barthelmann, On equational simple graphs, Tech. Rep. 9, Universität Mainz, Institut für Informatik 1997.
2. [Blu00] A. Blumensath, Prefix-recognisable graphs and monadic second-order logic, Aachener Informatik-Berichte 2001-6, Dep. Of Computer Science, RWTHAachen 2001.
3. [BG00] A. Blumensath, E. Grädel, Automatic structures, Proc. 15th IEEE Symp. Logic in Computer Science (2000), 51-62.
4. [Ber79] J. Berstel, Transductions and Context-Free Languages, Teubner, Stuttgart 1979.
5. [BE97] O. Burkart, J. Esparza, More infinite results, Bull. EATCS 62 (1997), 138-159.
6. [Bou01] 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.
7. [Büc60] J. R. Büchi, Weak second-order arithmetic and finite automata, Z. Math. Logik Grundl. Math. 6 (1960), 66-92.
8. [Büc65] J. R. Büchi, Regular canonical systems, Arch. Math. Logik u. Grundlagenforschung 6 (1964), 91-111.
9. [Cau96] 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.
10. [Cau01] 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.
11. [CK01] D. Caucal, T. Knapik, An internal presentation of regular graphs by prefixrecognizable graphs, Theory of Computing Systems 34 (2001), 299-336
12. [CGP99] E.M. Clarke, O. Grumberg, D. Peled, Model Checking, MIT Press 1999.
13. [Cou89] B. Courcelle, The monadic second-order logic of graphs II: Infinite graphs of bounded width, Math. Systems Theory 21 (1989), 187-221.
14. [EC*92] 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.
15. [Eil74] S. Eilenberg, Automata, Languages, and Machines, Vol. A, Academic Press 1974.
16. [EM65] C.C. Elgot, J. Mezei, On relations defined by generalized finite automata, IBM J. Res. Dev. 9 (1965), 47-68.
17. [EH*00] 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.
18. [ES01] 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.
19. [FS93] C. Frougny, J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theor. Comput. Sci. 108 (1993), 45-82.
20. [HU79] J.E. Hopcroft, J.D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley 1979.
21. [KS86] W. Kuich, A. Salomaa, Semirings, Automata, Languages, Springer 1986.
22. [Löd01] C. Löding, Model-checking infinite systems generated by ground tree rewriting, to appear in Proc. FOSSACS 2002, LNCS, Springer-Verlag 2002.
23. [McM93] K. L. McMillan, Symbolic Model Checking, Kluwer Academic Publishers 1993.
24. [Mor00] C. Morvan, On rational graphs, in: J. Tiuryn (Ed.), Proc. FOSSACS 2000, LNCS 1784 (2000), Springer-Verlag, pp. 252-266.
25. [MoS01] 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
26. [MS85] D. Muller, P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theor. Comput. Sci. 37 (1985), 51-75.
27. [Pen74] M. Penttonen, One-sided and two-sided context in formal grammars, Inform. Contr. 25 (1974), 371-392.
28. [Rab69] M.O. Rabin, Decidability of second-order theories and automata on infinite trees, Trans. Amer. Math. Soc. 141 (1969), 1-35.
29. [Ris01] C. Rispal, The synchronized graphs trace the context-sensitive languages, manuscript, IRISA, Rennes 2001.
30. [Tho97] 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.