Finite presentations of infinite structures: Automata and interpretations

Theory of Computing Systems

Volumn 37, Issue 6, 2004, Pages 641-674

  Blumensath, Achim ^a   Grädel, Erich ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION MODEL THEORY; FINITE MODEL THEORY; FIRST-ORDER LOGIC; INFINITE STRUCTURES;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING; SEMANTICS; SET THEORY;

FINITE AUTOMATA;

EID: 10844261656     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-004-1133-y     Document Type: Conference Paper

References (49)

1. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, Addison-Wesley, Reading, MA, 1995.
2. C. Ash and J. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Elsevier, Amsterdam, 2000.
3. K. Barthelmann, On equational simple graphs, Tech. Rep. 9, Institut für Informatik, Universität Mainz, 1997.
4. C. Bennett, Logical reversibility of computation, IBM Journal of Research and Development, 17 (1973), 525-532.
5. D. Berwanger and A. Blumensath, The monadic theory of tree-like structures, in Automata, Logic, and Infinite Games (E. Grädel, W. Thomas, and T. Wilke, eds.), Springer-Verlag, Berlin, 2002.
6. A. Blumensath, Automatic structures, Diplomarbeit, RWTH Aachen, 1999.
7. A. Blumensath, Prefix-recognisable graphs and monadic second-order logic, Tech. Rep. AIB-06-2001, RWTH Aachen, 2001.
8. A. Blumensath and E. Grädel, Automatic structures, in Proceedings of the 15th IEEE Symposium on Logic in Computer Science, 2000, pp. 51-62.
9. B. Boigelot, S. Rassart, and P. Wolper, On the expressiveness of real and integer arithmetic automata, in Proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP 98, Lecture Notes in Computer Science, vol. 1443, 1998, Springer-Verlag, Berlin, pp. 152-163.
10. V. Bruyère, G. Hansel, C. Michaux, and R. Villemaire, Logic and p-recognizable sets of integers, Bulletin of the Belgian Mathematical Society, 1 (1994), 191-238.
11. S. Buss, The boolean formula value problem is in ALOGTIME, in Proceedings 19th ACM Symposium on the Theory of Computing, 1987, pp. 123-131.
12. A. Carayol and S. Wöhrle, The Caucal hierarchy of infinite graphs in terms of logic and higher-order pushdown automata, Proceedings of FSTTCS, Lecture Notes in Computer Science, vol. 2914, Springer-Verlag, Berlin, 2003, pp. 112-123.
13. D. Caucal, On infinite transition graphs having a decidable monadic theory, in Automata, Languages and Programming, 23rd International Colloquium, ICALP 96, Lecture Notes in Computer Science, vol. 1099, Springer-Verlag, Berlin, 1996, pp. 194-205.
14. D. Caucal, On infinite terms having a decidable monadic theory, in Proceedings of the 21th International Symposium on Mathematical Foundations of Computer Science, MFCS 02, Lecture Notes in Computer Science, vol. 2420. Springer-Verlag, Berlin, 2002, pp. 165-176.
15. B. Courcelle, The monadic second-order logic of graphs, II: Infinite graphs of bounded width, Mathematical System Theory, 21 (1989), 187-221.
16. B. Courcelle, The monadic second-order logic of graphs, IX: Machines and their behaviours, Theoretical Computer Science, 151 (1995), 125-162.
17. B. Courcelle and I. Walukiewicz, Monadic second-order logic, graph coverings and unfoldings of transition systems, Annals of Pure and Applied Logic, 92 (1998), 35-62.
18. C. Delhomme, V. Goranko, and T. Knapik, Automatic linear orderings, Submitted.
19. H.-D. Ebbinghaus and J. Flum, Finite Model Theory, Springer-Verlag, Berlin, 1995.
20. S. Eilenberg, Automata, Languages, and Machines, vol. A, Academic Press, New York, 1974.
21. C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata, IBM Journal of Research Development, 9 (1965), 47-68.
22. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson, and W. Thurston, Word Processing in Groups, Jones and Bartlett, Boston, MA, 1992.
23. Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, Handbook of Recursive Mathematics, North-Holland, Amsterdam, 1998.
24. B. Farb, Automatic groups: a guided tour, L'Enseignement Mathématique, 38 (1992), 291-313.
25. S. Feferman and R. L. Vaught, The first order properties of products of algebraic systems, Fundamenta Mathematicae, XLVII (1959), 57-103.
26. E. Grädel, Simple interpretations among complicated theories, Information Processing Letters, 35 (1990), 235-238.
27. E. Grädel and Y. Gurevich, Metafinite model theory, Information and Computation, 140 (1998), 26-81.
28. E. Grädel and A. Malmström, 0-1 laws for recursive structures, Archive of Mathematical Logic, 38 (1999), 205-215.
29. E. Grädel and K. Meer, Descriptive complexity theory over the real numbers, in Mathematics of Numerical Analysis: Real Number Algorithms (J. Renegar, M. Shub, and S. Smale, eds.), Lectures in Applied Mathematics, vol. 32, AMS, Providence, RI, 1996, pp. 381-403.
30. Y. Gurevich, Monadic second-order theories, in Model-Theoretic Logics (J. Barwise and S. Feferman, eds.), Springer-Verlag, Berlin, 1985, pp. 479-506.
31. D. Harel, Towards a theory of recursive structures, in Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS 98, of Lecture Notes in Computer Science, vol. 1450, Springer-Verlag, Berlin, 1998, pp. 36-53.
32. T. Hirst and D. Harel, More about recursive structures: descriptive complexity and zero-one laws, in Proceedings of the 11th IEEE Symposium on Logic in Computer Science, 1996, pp. 334-348.
33. H. Hunt, III, D. Rosenkrantz, and T. Szymanski, On the equivalence, containment, and covering problems for the regular and context-free languages, Journal of Computer and System Sciences, 12 (1976), 222-268.
34. N. Immerman. Descriptive Complexity, Graduate Texts in Computer Science, Springer-Verlag, New York, 1998.
35. P. Kanellakis, G. Kuper, and P. Revesz, Constraint query languages, Journal of Computer and Systems Sciences, 51 (1995), 26-52. (An extended abstract appeared in the Proceedings of PODS '90).
36. B. Khoussainov and A. Nerode, Automatic presentations of structures, in Logic and Computational Complexity, Lecture Notes in Computer Science vol. 960, Springer-Verlag, Berlin, 1995, pp. 367-392.
37. B. Khoussainov, S. Rubin, and F. Stephan, On automatic partial orders, in Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, LICS, 2003, pp. 168-177.
38. G. Kuper, L. Libkin, and J. Paredaens, eds., Constraint Databases, Springer-Verlag, Berlin, 2000.
39. C. Loding, Model-checking infinite systems generated by ground tree rewriting, in Proceedings of Foundations of Software Science and Computation Structures, FoSSaCS 2002, Lecture Notes in Computer Science, vol. 2303, Springer-Verlag, Berlin, 2002, pp. 280-294.
40. A. R. Meyer and L. J. Stockmeyer, Word problems requiring exponential time, in Proceedings of the 5th ACM Symposium on the Theory of Computing, 1973, pp. 1-9.
41. C. Morvan, On rational graphs, in Proceedings of FOSSACS 2000, Lecture Notes in Computer Science, vol. 1784, Springer-Verlag, Berlin, 2000, pp. 252-266.
42. D. Muller and P. Schupp, Groups, the theory of ends, and context-free languages, Journal of Computer and System Sciences, 26 (1983), 295-310.
43. D. Muller and P. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, 37 (1985), 51-75.
44. A. L. Semenov, Decidability of Monadic Theories, Lecture Notes in Computer Science vol. 176, Springer-Verlag, Berlin, 1984, pp. 162-175.
45. S. Shelah, The monadic theory of order, Annals of Mathematics, 102 (1975), 379-419.
46. A. Stolboushkin, Towards recursive model theory, in Logic Colloquium 95 (J. Makowsky and E. Ravve, eds.), Lecture Notes in Logic, vol. 11, Springer-Verlag, Berlin, 1998, pp. 325-338.
47. W. Thomas, Ehrenfeucht games, the composition method, and the monadic theory of ordinal words, in Structures in Logic and Computer Science. A Selection of Essays in Honor of Andrzej Ehrenfeucht (G. Rozenberg, A. Salomaa, and J. Mycielski, eds.), Lecture Notes in Computer Science, vol.1261, Springer-Verlag, Berlin, 1997, pp. 118-143.
48. W. Thomas, Constructing infinite graphs with a decidable MSO-theory, in Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 03, Lecture Notes in Computer Science, vol. 2747, Springer-Verlag, Berlin, 2003, pp. 113-124.
49. I. Walukiewicz, Monadic second-order logic on tree-like structures, Theoretical Computer Science, 275 (2001), 311-346.