Logical aspects of Cayley-graphs: The group case

Annals of Pure and Applied Logic

Volumn 131, Issue 1-3, 2005, Pages 263-286

  Kuske, Dietrich ^a   Lohrey, Markus ^b  

^a DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^b UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 7444233687     PISSN: 01680072     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.apal.2004.06.002     Document Type: Article

References (71)

1. I. Adler, H. Scheuermann, M. Weyer, Finite character of f-tree-width via logical compactness, 2004 (manuscript)
2. A.V. Anisimov Group languages Kibernetika 4 1971 18-24 (in Russian)
3. Cybernetics 4 1973 594-601 (English translation)
4. Babai L. Automorphism groups, isomorphism, reconstruction in: Graham R.L. Grötschel M. Lovász L. (Eds.) Handbook of Combinatorics vol. II 1995 1447-1540 Elsevier Science Publishers (Chapter 27)
5. A. Blumensath, Prefix-recognizable graphs and monadic second-order logic, Technical Report 2001-06, RWTH Aachen, Department of Computer Science, 2001
6. Bodlaender H.L. A note on domino treewidth Discrete Mathematics & Theoretical Computer Science 3 4 1999 141-150
7. Bodlaender H.L. Engelfriet J. Domino treewidth Journal of Algorithms 24 1 1997 94-123
8. Boone W.W. Higman G. An algebraic characterization of groups with soluble word problem Journal of the Australian Mathematical Society 18 1974 41-53
9. Caucal D. On the regular structure of prefix rewriting Theoretical Computer Science 106 1992 61-86
10. Caucal D. On infinite transition graphs having a decidable monadic theory in: Auf der Heide F.M. Monien B. (Eds.) Proceedings of the 23nd International Colloquium on Automata, Languages and Programming ICALP'96, Paderborn, Germany Lecture Notes in Computer Science number 1099 1996 194-205 Springer
11. Caucal D. On infinite terms having a decidable monadic theory Diks K. Rytter W. Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science MFCS 2002, Warsaw, Poland Lecture Notes in Computer Science number 2420 2002 165-176 Springer
12. Caucal D. On infinite transition graphs having a decidable monadic theory Theoretical Computer Science 290 1 2002 79-115
13. Cayley A. On the theory of groups Proceedings of the London Mathematical Society (1) 9 1878 126-133
14. Chandra A.K. Kozen D.C. Stockmeyer L.J. Alternation Journal of the Association for Computing Machinery 28 1 1981 114-133
15. Courcelle B. The monadic second-order logic of graphs, II: Infinite graphs of bounded width Mathematical Systems Theory 21 1989 187-221
16. Courcelle B. The monadic second-order logic of graphs VI: On several representations of graphs by relational structures Discrete Applied Mathematics 54 1994 117-149
17. Courcelle B. The expression of graph properties and graph transformations in monadic second-order logic Rozenberg G. Handbook of Graph Grammars and Computing by Graph Transformation, vol. 1 Foundations 1997 313-400 World Scientific
18. Courcelle B. Olari S. Upper bounds on the clique-width of graphs Discrete Applied Mathematics 101 2000 77-114
19. D'Agostino G. Cayley graphs of virtually free groups International Journal of Algebra and Computation 3 2 1993 189-199
20. Dehn M. Über die Toplogie des dreidimensionalen Raumes Mathematische Annalen 69 1910 137-168 (in German)
21. Dicks W. Dunwoody M.J. Groups Acting on Graphs 1989 Cambridge University Press
22. Diekert V. Lohrey M. A note on the existential theory of equations in plain groups International Journal of Algebra and Computation 12 1-2 2002 1-7
23. Diekert V. Lohrey M. Word equations over graph products Pandya P.K. Radhakrishnan J. Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science FSTTCS 2003, Mumbai, India Lecture Notes in Computer Science number 2914 2003 156-167 Springer
24. Diekert V. Lohrey M. Existential and positive theories of equations in graph products Theory of Computing Systems 37 1 2004 133-156
25. Diestel R. Graph Theory second ed. 2000 Springer
26. Ding G. Oporowski B. Some results on tree decomposition of graphs Journal of Graph Theory 20 1995 481-499
27. Dunwoody M.J. Cutting up graphs Combinatorica 2 1 1981 15-23
28. Dunwoody M.J. The accessibility of finitely presented groups Inventiones Mathematicae 81 1985 449-457
29. Ebbinghaus H.-D. Flum J. Finite Model Theory 1991 Springer
30. Elgot C.C. Rabin M.O. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor Journal of Symbolic Logic 31 2 1966 169-181
31. Ferrante J. Rackoff C. The Computational Complexity of Logical Theories Lecture Notes in Mathematics number 718 1979 Springer
32. Gaifman H. On local and nonlocal properties in: Stern J. (Ed.) Logic Colloquium'81 1982 105-135 North-Holland Amsterdam
33. Gurevich Y. Monadic second-order theories in: Barwise J. Feferman S. (Eds.) Model-Theoretic Logics 1985 479-506 Springer
34. Haring-Smith R.H. Groups and simple languages Transactions of the American Mathematical Society 279 1983 337 -356
35. Herbst T. Thomas R.M. Group presentations, formal languages and characterizations of one-counter groups Theoretical Computer Science 112 1983 187-213
36. Higman G. Subgroups of finitely presented groups Proceedings of the Royal Society of London, Series A 262 1961 455-475
37. Hodges W. Model Theory 1993 Cambridge University Press
38. Kuske D. Lohrey M. Decidable theories of Cayley-graphs in: Alt H. Habib M. (Eds.) Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science STACS 2003, Berlin, Germany Lecture Notes in Computer Science number 2607 2003 463-474 Springer
39. A.A. Letičevskiǐ L.B. Smikun On a class of groups with solvable problem of automata equivalence Doklady Akademii Nauk SSSR 227 1976 36-38 (in Russian)
40. Soviet Mathematics, Doklady 17 1976 341-344 (English translation)
41. Lyndon R.C. On Dehn's algorithm Mathematical Annales 166 1966 208-228
42. Lyndon R.C. Schupp P.E. Combinatorial Group Theory 1977 Springer
43. Magnus W. Karrass A. Solitar D. Combinatorial Group Theory 1966 Wiley
44. G.S. Makanin Equations in a free group Izvestiya Akademii Nauk SSR, Ser. Math. 46 1983 1199-1273 (in Russian)
45. Mathematics of the USSR Izvestija 21 1983 (English translation)
46. G.S. Makanin Decidability of the universal and positive theories of a free group Izvestiya Akademii Nauk SSSR, Ser. Math. 48 1984 735-749 (in Russian)
47. Mathematics of the USSR Izvestija 25 1985 75-88 (English translation)
48. Meyer A.R. Weak monadic second order theory of one successor is not elementary recursive in: Proceedings of the Logic Colloquium Boston 1972-73 Lecture Notes in Mathematics number 453 1975 132-154 Springer
49. Muller D.E. Schupp P.E. Groups, the theory of ends, and context-free languages Journal of Computer and System Sciences 26 1983 295-310
50. Muller D.E. Schupp P.E. The theory of ends, pushdown automata, and second-order logic Theoretical Computer Science 37 1 1985 51-75
51. Papadimitriou C.H. Computational Complexity 1994 Addison Wesley
52. Pélecq L. Automorphism groups of context-free graphs Theoretical Computer Science 165 2 1996 275-293
53. Rabin M.O. Decidability of second-order theories and automata on infinite trees Transactions of the American Mathematical Society 141 1969 1-35
54. Rips E. Sela Z. Canonical representatives and equations in hyperbolic groups Inventiones Mathematicae 120 1995 489-512
55. Robertson N. Seymour P.D. Graph minors II. Algorithmic aspects of tree-width Journal of Algorithms 78 1986 309-322
56. Schupp P.E. Groups and graphs: Groups acting on trees, ends, and cancellation diagrams Mathematical Intelligencer 1 1979 205-222
57. Schupp P.E. Arrays, automata and groups: Some interconnections in: Choffrut Ch. (Ed.) Proceedings of Automata Networks, LITP Spring School on Theoretical Computer Science France Angelés-Village, Lecture Notes in Computer Science number 316 1988 19-28 Springer
58. Seese D. Tree-partite graphs and the complexity of algorithms in: Budach L. (Ed.) Proceedings of Fundamentals of Computation Theory, FCT'85, Cottbus, GDR Lecture Notes in Computer Science number 199 1985 412-421
59. Seese D. The structure of models of decidable monadic theories of graphs Annals of Pure and Applied Logic 53 1991 169-195
60. Sénizergues G. An effective version of Stalling's theorem in the case of context-free groups in: Lingas A. Karlsson R.G. Carlsson S. (Eds.) Proceedings of the 20th International Colloquium on Automata, Languages and Programming, ICALP 93 Lund, Sweden Lecture Notes in Computer Science number 700 1993 478-495 Springer
61. Sénizergues G. Semi-groups acting on context-free graphs in: Auf der Heide F.M. Monien B. (Eds.) Proceedings of the 23th International Colloquium on Automata, Languages and Programming, ICALP'96 Paderborn, Germany Lecture Notes in Computer Science number 1099 1996 206-218 Springer
62. Serre J.-P. Trees 1980 Springer
63. Shelah S. The monadic theory of order Annals of Mathematics, II. Series 102 1975 379 419
64. Smikun L.B. Über den Zusammenhang kontextfreier Gruppen und Gruppen mit lösbarem Problem der Äquivalenz von Automaten Kibernetika 5 1976 33-37 (in Russian)
65. Stallings J.R. Group Theory and Three-Dimensional Manifolds Yale Mathematical Monographs number 4 1971 Yale University Press
66. Stolboushkin A.P. Taitslin M.A. Deterministic dynamic logic is strictly weaker than dynamic logic Information and Control 57 1 1983 48-55
67. Thomas W. Ehrenfeucht games, the composition method, and the monadic theory of ordinal words in: Mycielski J. Rozenberg G. Salomaa A. (Eds.) Structures in Logic and Computer Science, A Selection of Essays in Honor of A. Ehrenfeucht Lecture Notes in Computer Science number 1261 1997 118-143 Springer
68. Thomas W. Elements of an automata theory over partial orders in: Peled D. et al. (Eds.) Partial order methods in verification DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 29 1997 25-40
69. Thomassen C. Configurations in graphs of large minimum degree, connectivity, or chromatic number Proceedings of the 3rd International Conference on Combinatorial Mathematics Annals of the New York Academy of Sciences number 555 1989 402-412
70. Thomassen C. Woess W. Vertex-transitive graphs and accessibility Journal of Combinatorial Theory, Series B 58 1993 248-268
71. W. Woess Graphs and groups with tree-like properties Journal of Combinatorial Theory Series B 47 1989