Axiomatising tree-interpretable structures

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

Volumn 2285, Issue , 2002, Pages 596-607

  Blumensath, Achim ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

CARDINALITIES; RELATIONAL STRUCTURES; SECOND-ORDER LOGIC;

TREES (MATHEMATICS);

STRUCTURES; TREES;

EID: 44849105114     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45841-7_49     Document Type: Conference Paper

References (24)

1. K. Barthelmann, On equational simple graphs, Tech. Rep. 9, Universit¨at Mainz, Institut für Informatik, 1997.
2. K. Barthelmann, When can an equational simple graph be generated by hyperedge replace ment?, LNCS, 1450 (1998), pp. 543–552.
3. A. Blumensath, Automatic Structures, Diploma Thesis, RWTH Aachen, 1999.
4. A. Blumensath, Axiomatising tree-interpretable structures, Tech. Rep. AIB-10-2001, RWTH Aachen, LuFG Mathematische Grundlagen der Informatik, 2001.
5. A. Blumensath and E. Grädel, Automatic structures, in Proc. 15th IEEE Symp. on Logic in Computer Science, 2000, pp. 51–62.
6. O. Burkart, Model checking rationally restricted right closures of recognizable graphs, ENTCS, 9 (1997).
7. D. Caucal, On infinite transition graphs having a decidable monadic theory, LNCS, 1099 (1996), pp. 194–205.
8. B. Courcelle, The monadic second-order logic of graphs II: Infinite graphs of bounded width, Math. System Theory, 21 (1989), pp. 187–221.
9. B. Courcelle, The monadic second-order logic of graphs IV: Definability properties of equa- tional graphs, Annals of Pure and Applied Logic, 49 (1990), pp. 193–255.
10. B. Courcelle, The monadic second-order logic of graphs VII: Graphs as relational structures, Theoretical Computer Science, 101 (1992), pp. 3–33.
11. B. Courcelle, Structural properties of context-free sets of graphs generated by vertex replacement, Information and Computation, 116 (1995), pp. 275–293.
12. B. Courcelle, Clique-width of countable graphs: A compactness property. unpublished, 2000.
13. Y. L. Ershov, S. S. Goncharov, A. Nerode, and J. B. Remmel, Handbook of Recursive Mathematics, North-Holland, 1998.
14. 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.
15. B. Khoussainov and A. Nerode, Automatic presentations of structures, LNCS, 960 (1995), pp. 367–392.
16. G. Kuper, L. Libkin, and J. Paredaens, Constraint Databases, Springer-Verlag, 2000.
17. O. Kupferman and M. Y. Vardi, An automata-theoretic approach to reasoning about infinite-state systems, LNCS, 1855 (2000), pp. 36–52.
18. C. Morvan, On rational graphs, LNCS, 1784 (1996), pp. 252–266.
19. D. E. Muller and P. E. Schupp, Groups, the theory of ends, and context-free languages, J. of Computer and System Science, 26 (1983), pp. 295–310.
20. D. E. Muller and P. E. Schupp, The theory of ends, pushdown automata, and second-order logic, Theoretical Computer Science, 37 (1985), pp. 51–75.
21. L. Pélecq, Isomorphismes et automorphismes des graphes context-free, equation-nels et automatiques, Ph. D. Thesis, Universit´e Bordeaux I, 1997.
22. G. Sénizergues, Decidability of bisimulation equivalence for equational graphs of finite out-degree, in Proc. 39th Annual Symp. on Foundations of Computer Science, 1998, pp. 120–129.
23. C. Stirling, Decidability of bisimulation equivalence for pushdown processes. unpublished, 2000.
24. W. Thomas, Languages, automata, and logic, in Handbook of Formal Languages, G. Rozenberg and A. Salomaa, eds., vol. 3, Springer, New York, 1997, pp. 389–455.