Axiomatising Tree-Interpretable Structures

Theory of Computing Systems

Volumn 37, Issue 1, 2004, Pages 3-27

  Blumensath, Achim ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

AXIOMATIZATION; MATHEMATICAL CARDINALITIES;

ALGORITHMS; FINITE AUTOMATA; FORMAL LOGIC; MATHEMATICAL MODELS; SET THEORY;

TREES (MATHEMATICS);

EID: 1342291027     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1104-8     Document Type: Conference Paper

References (31)

1. K. Barthelmann, On equational simple graphs, Tech. Rep. 9, Institut für Informatik, Universität Mainz, 1997.
2. K. Barthelmann, When Can an Equational Simple Graph be Generated by Hyperedge Replacement?, LNCS 1450, Springer-Verlag, Berlin. 1998, pp. 543-552.
3. A. Blumensath, Automatic Structures, Diploma Thesis, RWTH Aachen, 1999.
4. A. Blumensath and E. Grädel, Automatic structures, in Proc. 15th IEEE Symp. on Logic in Computer Science, 2000, pp. 51-62.
5. O. Burkart, Model checking ratianally restricted right closures of recognizable graphs, ENTCS, 9 (1997).
6. D. Caucal, On Infinite Transition Graphs Having a Decidable Monadic Theory, LNCS 1099, Springer-Verlag, Berlin, 1996, pp. 194-205.
7. B. Courcelle, The monadic second-order logic of graphs, II Infinite graphs of bounded width, Math. System Theory, 21 (1989), 187-221.
8. B. Courcelle, The monadic second-order logic of graphs, IV: Definability properties of equational graphs, Ann. Pure Appl. Logic, 49 (1990), 193-255.
9. B. Courcelle, The monadic second-order logic of graphs, VII: Graphs as relational structures, Theoret. Comput. Sci., 101 (1992), 3-33.
10. B. Courcelle, The monadic second-order logic of graphs, VI: On several representations of graphs by relational structures, Discrete Appl. Math., 54 (1994), 117-149.
11. B. Courcelle, Structural properties of context-free sets of graphs generated by vertex replacement, Inform. and Comput., 116 (1995), 275-293.
12. B. Courcelle, Clique-width of countable graphs: a compactness property, Unpublished, 2000.
13. B. Courcelle, The monadic second-order logic of graphs, XIV: Uniformly sparse graphs and edge set quantifications, Theoret. Comput. Sci., 299 (2003), 1-36.
14. B. Courcelle, J. Engelfriet, and G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. System Sci., 46 (1993), 218-270.
15. B. Courcelle and S. Olariu, Upper bounds to the clique width of graphs, Discrete Appl. Math., 101 (2000), pp. 77-114.
16. Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, Handbook of Recursive Mathematics, North-Holland, Amsterdam, 1998.
17. E. Grädel, C. Hirsch, and M. Otto, Back and forth between guarded and modal logics, in Proc. 15th IEEE Symp. on Logic in Computer Science, 2000, pp. 217-228.
18. B. Khoussainov and A. Nerode, Automatic Presentations of Structures, LNCS 960, Springer-Verlag, Berlin, 1995, pp. 367-392.
19. G. Kuper, L. Libkin, and J. Paredaens, Constraint Databases, Springer-Verlag, Berlin, 2000.
20. O. Kupferman and M. Y. Vardi, An Automata-Theoretic Approach to Reasoning about Infinite-State Systems, LNCS 1855, Springer-Verlag, Berlin, 2000, pp. 36-52.
21. C. Morvan, On Rational Graphs, LNCS 1784, Springer-Verlag, Berlin, 1996, pp. 252-266.
22. D. E. Muller and P. E. Schupp, Groups, the theory of ends, and context-free languages, J. Comput. System Sci., 26 (1983), 295-310.
23. D. E. Muller and P. E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoret. Comput. Sci., 37 (1985), 51-75.
24. L. Pélecq, Isomorphismes et automorphismes des graphes context-free, équationnels et. automatiques, Ph.D. Thesis, Université Bordeaux I, 1997.
25. M. O. Rabin, Decidability of second order theories and automata on infinite trees, Trans. Am. Math. Soc., 141 (1969), 1-35.
26. D. Seese, Entscheidbarkeits- und Definierbarkeitsfragen der Theorie "netzartiger" Graphen, Wiss. Z. Humbold-Univer. Berlin Math. Natur. Reihe, XXI (1972), 513-517.
27. D. Seese, The structure of the models of decidable monadic theories of graphs, Ann. Pure Appl. Logic, 53(1991), 169-195.
28. G. Sénizergues, Decidability of bisimulation equivalence for equational graphs of finite out-degree, in Proc. 39th Ann. Symp. on Foundations of Computer Science, 1998, pp. 120-129.
29. C. Stirling, Decidability of bisimulation equivalence for pushdown processes, Unpublished, 2000.
30. W. Thomas, Languages, automata, and logic, in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, eds., vol. 3, Springer-Verlag, New York, 1997, pp. 389-455.
31. I. Walukiewicz, Monadic second-order logic on tree-like structures, Theoret. Comput. Sci., 275 (2002), 311-346.