Word equations over graph products

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

Volumn 2914, Issue , 2003, Pages 156-167

  Diekert, Volker ^a   Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; SOFTWARE ENGINEERING;

GRAPH PRODUCT; MONOIDS; UNDECIDABILITY; WORD EQUATIONS;

GRAPH THEORY;

EID: 35248879684     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_14     Document Type: Article

References (22)

1. L. Berman. The complexity of logical theories. Theo. Comp. Sci., 11:71-77, 1980.
2. J. Berstel. Transductions and context-free languages. Teubner, 1979.
3. V. Diekert, C. Gutiérrez, and C. Hagenah. The existential theory of equations with rational constraints in free groups is PSPACE-complete. In Proc. STACS 2001, LNCS 2010, pages 170-182. Springer, 2001.
4. V. Diekert and M. Lohrey. A note on the existential theory of equations in plain groups. Int. J. Algebra Comput., 12(1 & 2):1-7, 2002.
5. V. Diekert and M. Lohrey. Existential and positive theories of equations in graph products. Theory of Computing Systems, 2003.
6. To appear, short version in Proc. STACS 2002, LNCS 2285, pages 501-512. Springer, 2001.
7. V. Diekert and M. Lohrey. Word equations over graph products. Manuscript available from the authors, 2003
8. V. Diekert, Y. Matiyasevich, and A. Muscholl. Solving word equations modulo partial commutations. Theo. Comp. Sci., 224(1-2):215-235, 1999.
9. V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In Proc. ICALP 2001, LNCS 2076, pages 543-554. Springer, 2001.
10. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, 1995.
11. 3-theory of a free semi-group. Sib. Math. J., 36(5):1067-1080, 1995.
12. S. Feferman and R. L. Vaught. The first order properties of products of algebraic systems. Fund. Mat., 47:57-103, 1959.
13. E. R. Green. Graph Products of Groups. PhD thesis, University of Leeds, 1990.
14. S. Hermiller and J. Meier. Algorithms and geometry for graph products of groups. J. Algebra, 171:230-257, 1995.
15. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. Sbornik, 103:147-236, 1977.
16. G. S. Makanin. Decidability of the universal and positive theories of a free group. Izv. Akad. Nauk SSSR, Ser. Mat. 48:735-749, 1984.
17. A. Muscholl. Decision and Complexity Issues on Concurrent Systems. Habilitation thesis, Universität Stuttgart, 1999.
18. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In Proc. FOCS 99, pages 495-500. IEEE Computer Society Press, 1999.
19. M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In C. R. Congrès Math. Pays slaves, pages 92-101, 1929.
20. E. Rips and Z. Sela. Canonical representatives and equations in hyperbolic groups. Invent. Math., 120:489-512, 1995.
21. K. U. Schulz. Makanin's algorithm for word equations - Two improvements and a generalization. In Word Equations and Related Topics, LNCS 572, pages 85-150. Springer, 1991.
22. Z. Sela. Diophantine geometry over groups VIII: The elementary theory of a hyperbolic group. Available via http://www.ma.huji.ac.il/zlil/, 2002.