Existential and Positive Theories of Equations in Graph Products

Theory of Computing Systems

Volumn 37, Issue 1, 2004, Pages 133-156

  Diekert, Volker ^a   Lohrey, Markus ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

FREE MONOIDS; NORMALIZATION METHODS;

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; CONFORMAL MAPPING; CONSTRAINT THEORY; SET THEORY;

GRAPH THEORY;

EID: 1342333622     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1110-x     Document Type: Conference Paper

References (44)

1. I. J. Aalbersberg and H. J. Hoogeboom. Characterizations of the decidability of some problems for regular trace languages. Mathematical Systems Theory, 22:1-19, 1989.
2. M. Benois. Parties rationnelles du groupe libre. Computes Rendus des Séances de l'Académie des Sciences, Série A, 269:1188-1190, 1969.
3. L. Berman, The complexity of logical theories. Theoretical Computer Science, 11:71-77, 1980.
4. J. Berstel. Transductions and Context-free Languages. Teubner Studienbücher, Stuttgart, 1979.
5. R. V. Book and F. Otto. String-Rewriting Systems, Springer-Verlag, Berlin, 1993.
6. P. Cartier and D. Foata. Problèmes combinatoires de commutation et réarrangements. Number 85 in Lecture Notes in Mathematics. Springer-Verlag, Berlin, 1969.
7. V. Diekert, C. Gutiérrez, and C. Hagenah. The existential theory of equations with rational constraints in free groups is PSPACE-complete. In A. Ferreira and H. Reichel, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STAGS 2001), Dresden (Germany), pages 170-182. Number 2010 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
8. V. Diekert and M. Lohrey. Existential and positive theories of equations in graph products. In H. Alt and A. Ferreira, editors, Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STAGS 2002), Juan les Pins (France), pages 501-512. Number 2285 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2002.
9. V. Diekert and M. Lohrey. A note on the existential theory of equations in plain groups. International Journal of Algebra and Computation, 12(1&2):1-7, 2002.
10. V. Diekert, Y. Matiyasevich, and A. Muscholl. Solving word equations modulo partial commutations. Theoretical Computer Science, 224(1-2):215-235, 1999.
11. V. Diekert and A. Muscholl. Solvability of equations in free partially commutative groups is decidable. In F. Orejas, P. G. Spirakis, and J. van Leeuwen, editors, Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP 2001), Crete (Greece), pages 543-554. Number 2076 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 2001.
12. V. Diekert and G. Rozenberg, editors. The Book of Traces. World Scientific, Singapore, 1995.
13. C. Droms. Graph groups, coherence and three-manifolds. Journal of Algebra, 106(2):484-489, 1985.
14. 3 Theory of a free semi-group. Siberian Mathematical Journal, 36(5):917-929, 1995. English translation.
15. S. Feferman and R. L. Vaught. The first order properties of products of algebraic systems. Fundamenta Mathematicae, 47:57-103, 1959.
16. J. Ferrante and C. Rackoff. A decision procedure for the first order theory of real addition with order. SIAM Journal on Computing, 4:69-76, 1975.
17. E. R. Green. Graph Products of Groups. Ph.D. thesis, The University of Leeds, 1990.
18. C. Gutiérrez. Satisfiability of equations in free groups is in PSPACE. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC'2000), pages 21-27. ACM Press, New York, 2000.
19. R. H. Haring-Smith. Groups and simple languages. Transactions of the American Mathematical Society, 279:337-356, 1983.
20. S. Hermiller and J. Meier. Algorithms and geometry for graph products of groups. Journal of Algebra, 171:230-257, 1995.
21. M. Jantzen. Confluent String Rewriting. EATCS Monographs on Theoretical Computer Science, volume 14. Springer-Verlag, Berlin, 1988.
22. D. Kozen. Lower bounds for natural proof systems. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS 77), pages 254-266. IEEE Computer Society Press, Los Alamitos, CA, 1977.
23. G. Lallement. Semigroups and Combinatorial Applications. Wiley-Interscience, New York, 1979.
24. M. Lohrey. Confluence problems for trace rewriting systems. Information and Computation, 170:1-25, 2001.
25. G. S. Makanin. The problem of solvability of equations in a free semigroup. Mathematicheskiǐ Sbomik, 103:147-236, 1977. In Russian; English translation in Mathematics of the USSR-Sbomik, 32:129-198, 1977.
26. G. S. Makanin. The problem of solvability of equations in a free semigroup. Mathematicheskiǐ Sbomik, 103:147-236, 1977. In Russian; English translation in Mathematics of the USSR-Sbomik, 32:129-198, 1977.
27. G. S. Makanin. Equations in a free group. Izvestiya Akademii Nauk SSR. Seriya Mathematicheskaya, 46:1199-1273, 1983. In Russian; English translation in Mathematics of the USSR-Izvestija, 21:483-546, 1983.
28. G. S. Makanin. Equations in a free group. Izvestiya Akademii Nauk SSR. Seriya Mathematicheskaya, 46:1199-1273, 1983. In Russian; English translation in Mathematics of the USSR-Izvestija, 21:483-546, 1983.
29. G. S. Makanin. Decidability of the universal and positive theories of a free group. Izvestiya Akademii Nauk SSR. Seriya Mathematicheskaya, 48:735-749, 1984. In Russian; English translation in Mathematics of the USSR-Izvestija, 25:75-88, 1985.
30. G. S. Makanin. Decidability of the universal and positive theories of a free group. Izvestiya Akademii Nauk SSR. Seriya Mathematicheskaya, 48:735-749, 1984. In Russian; English translation in Mathematics of the USSR-Izvestija, 25:75-88, 1985.
31. S. S. Marchenkov. Unsolvability of the positive ∀∃-theory of a free semi-group. Sibirskiǐ Matematicheskiǐ Zhumal, 23(1):196-198, 1982. In Russian.
32. G. Markowsky. Bounds on the index and period of a binary relation on a finite set. Semigroup Forum, 13:253-259, 1977.
33. A. Mazurkiewicz. Concurrent program schemes and their interpretations. DAIMI Rep. PB 78, Aarhus University, Aarhus, 1977.
34. Y. I. Merzlyakov. Positive formulas on free groups. Algebra i Logika, 5(4):25-42, 1966. In Russian.
35. A. Muscholl. Decision and Complexity Issues on Concurrent Systems. Habilitation thesis, Universität Stuttgart, 1999.
36. P. Narendran and F. Otto. Prep'erfectness is undecidable for Thue systems containing only length-reducing rules and a single commutation rule. Information Processing Letters, 29:125-130, 1988.
37. M. H. A. Newman. On theories with a combinatorial definition of "equivalence". Annals of Mathematics, 43:223-243, 1943.
38. E. Ochmański. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56-67, 1985.
39. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, Reading, MA, 1994.
40. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science (FOCS 99), pages 495-500. IEEE Computer Society Press, Los Alamitos, CA, 1999.
41. M. Presburger. Über die Vollständigkeit eines gewissen Systems der Arithmetik ganzer Zahlen, in welchem die Addition als einzige Operation hervortritt. In Comptes Rendus du Premier Congrès des Mathématicienes des Pays Slaves, Warsaw, pages 92-101, 1929.
42. E. Rips and Z. Sela. Canonical representatives and equations in hyperbolic groups. Inventiones Mathematicae, 120:489-512, 1995.
43. K. U. Schulz. Makanin's algorithm for word equations - two improvements and a generalization. In K. U. Schulz, editor, Word Equations and Related Topics, pages 85-150. Number 572 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991.
44. A. Veloso da Costa. Graph products of monoids. Semigroup Forum, 63(2):247-277, 2001.