The existential theory of equations with rational constraints in free groups is PSPACE-complete

Information and Computation

Volumn 202, Issue 2, 2005, Pages 105-140

  Diekert, Volker ^a   Gutierrez, Claudio ^b   Hagenah, Christian ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; POLYNOMIALS; PROBLEM SOLVING; WORD PROCESSING;

EXISTENTIAL THEORY OF EQUATIONS; RATIONAL CONSTRAINT; WORD EQUATIONS; WORD LANGUAGES;

CONSTRAINT THEORY;

EID: 26444550722     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2005.04.002     Document Type: Article

References (43)

1. M. Benois Parties rationelles du groupe libre C.R. Acad. Sci. Paris, Sér. A 269 1969 1188 1190
2. J. Berstel Transductions and Context-free Languages 1979 Teubner Studienbücher Stuttgart
3. V. Diekert Makanin's Algorithm M. Lothaire Algebraic Combinatorics on Words, volume 90 of Encyclopedia of Mathematics and its Applications 2002 Cambridge University Press Cambridge 387 442 Chapter 12
4. V. Diekert, C. Gutierrez, C. Hagenah, The existential theory of equations with rational constraints in free groups is PSPACE-complete, in: A. Ferreira, H. Reichel (Eds.), Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS'01), Dresden (Germany), 2001, Lecture Notes in Computer Science, vol. 2010, Springer-Verlag, Berlin, 2001, pp. 170-182.
5. V. Diekert, M. Lohrey. Word equations over graph products, in: P.K. Pandya, J. Radhakrishnan (Eds.), Proceedings of the 23rd Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2003), Mumbai (India), Lecture Notes in Computer Science, vol. 2914, Springer-Verlag, Berlin, 2003, pp. 156-167.
6. V. Diekert, and M. Lohrey Existential and positive theories of equations in graph products Theory Comput. Syst. 37 2004 133 156
7. V. Diekert, Yu. Matiyasevich, and A. Muscholl Solving word equations modulo partial commutations Theoretical Comput. Sci. 224 1999 215 235 Special issue of LFCS'97
8. V. Diekert, A. Muscholl. Solvability of equations in free partially commutative groups is decidable, in: F. Orejas, P.G. Spirakis, J. van Leeuwen (Eds.), Proceedings of the 28th International Colloquium on Automata, Languages and Programming (ICALP'01), Lecture Notes in Computer Science, vol. 2076, Springer-Verlag, Berlin Heidelberg, 2001, pp. 543-554.
9. V.G. Durnev, Undecidability of the positive ∀ ∃ 3 -theory of a free semi-group. Sibirsky Matematicheskie Jurnal, 36(5) (1995) 1067-1080.
10. (In Russian; English translation: Sib. Math. J. 36(5) (1995) 917-929).
11. S. Eilenberg, Automata, Languages, and Machines, volume A. Academic Press, New York and London, 1974.
12. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 W.H. Freeman and Company San Francisco
13. J. von zur Gathen, and M. Sieveking A bound on solutions of linear integer equalities and inequalities Proc. Am. Math. Soc. 72 1 1978 155 158
14. Y. Gurevich, A. Voronkov, Monadic simultaneous rigid E-unification and related problems, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), Proceedings of the 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Bologna, Lecture Notes in Computer Science, vol. 1256, Springer-Verlag, Berlin Heidelberg, 1997, pp. 154-165.
15. C. Gutierrez, Satisfiability of word equations with constants is in exponential space, in: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS'98), Los Alamitos (California), EEE Computer Society Press, 1998, pp. 112-119.
16. C. Gutierrez, Equations in free semigroups with anti-involution and their relation to equations in free groups, in: G.H. Gonnet, D. Panario, A. Viola (Eds.), Proceedings Latin American Theoretical INformatics, LATIN'2000, Lecture Notes in Computer Science, vol. 1776, Springer-Verlag, Berlin, 2000, pp. 387-396.
17. C. Gutierrez, Satisfiability of equations in free groups is in PSPACE, in: Proceedings 32nd Annual ACM Symposium on Theory of Computing, STOC'2000, ACM Press, 2000, pp. 21-27.
18. C. Hagenah, Gleichungen mit regulären Randbedingungen über freien Gruppen, Ph.D. thesis, Institut für Informatik, Universität Stuttgart, 2000.
19. J.E. Hopcroft, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 1979 Addison-Wesley Reading, MA
20. J. Karhumäki, F. Mignosi, and W. Plandowski The expressibility of languages and relations by word equations J. Assoc. Comput. Machinery 47 2000 483 505
21. A. Kościelski, and L. Pacholski Complexity of Makanin's algorithm J. Assoc. Comput. Machinery 43 4 1996 670 684
22. A. Kościelski, and L. Pacholski Makanin's algorithm is not primitive recursive Theoretical Comput. Sci. 191 1998 145 156
23. D. Kozen, Lower bounds for natural proof systems, in: Proceedings of the 18th Annual Symposium on Foundations of Computer Science, FOCS'77, Providence, Rhode Island, IEEE Computer Society Press, 1977, pp. 254-266.
24. M. Lothaire, Combinatorics on words, in: Encyclopedia of Mathematics and its Applications, vol. 17 Addison-Wesley, Reading, MA, 1983, Reprinted by Cambridge University Press, 1997.
25. G.S. Makanin, The problem of solvability of equations in a free semigroup. Math. Sbornik, 103 (1977) 147-236.
26. English transl. in Math. USSR Sbornik 32 (1977).
27. G.S. Makanin, Equations in a free group. Izv. Akad. Nauk SSR, Ser. Math. 46 (1982) 1199-1273.
28. English transl. in Math. USSR Izv. 21 (1983).
29. G.S. Makanin, Decidability of the universal and positive theories of a free group. Izv. Akad. Nauk SSSR, Ser. Mat. 48 (1984) 735-749.
30. In Russian; English translation in: Math. USSR Izvestija, 25 (1985) 75-88.
31. S.S. Marchenkov Unsolvability of positive ∀ ∃ -theory of a free semi-group Sibirsky Matematicheskie Jurnal 23 1 1982 196 198 In Russian
32. G. Markowsky Bounds on the index and period of a binary relation on a finite set Semigroup Forum 13 1977 253 259
33. Yu. Matiyasevich, Reduction of trace equations to word equations. Talk given at the "Colloquium on Computability, Complexity, and Logic", Institut für Informatik, Universität Stuttgart, Germany, Dec. 5-6, 1996.
34. Yu. Matiyasevich, Some decision problems for traces, in: S. Adian, A. Nerode (Eds.), Proceedings of the 4th International Symposium on Logical Foundations of Computer Science (LFCS'97), Yaroslavl, Russia, July 6-12, 1997, Lecture Notes in Computer Science, vol. 1234, Springer-Verlag, Berlin Heidelberg, 1997, pp. 248-257 (Invited lecture).
35. Yu.I. Merzlyakov Positive formulae over free groups Algebra i Logika 5 4 1966 25 42 In Russian
36. W. Plandowski, Testing equivalence of morphisms on context-free languages, in: J. van Leeuwen (Ed.), Algorithms-ESA'94, Second Annual European Symposium, Lecture Notes in Computer Science, vol. 855, Utrecht, The Netherlands, Springer, 1994, pp. 460-470.
37. W. Plandowski, Satisfiability of word equations with constants is in NEXPTIME, in: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99, ACM Press, 1999, pp. 721-725.
38. 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, IEEE Computer Society Press, 1999, pp. 495-500.
39. W. Plandowski Satisfiability of word equations with constants is in PSPACE J. Assoc. Comput. Machinery 51 2004 483 496
40. W. Plandowski, W. Rytter, Application of Lempel-Ziv encodings to the solution of word equations, in: K.G. Larsen et al., (Eds.), Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP'98), Aalborg (Denmark), 1998, Lecture Notes in Computer Science, vol. 1443, Springer-Verlag, Berlin Heidelberg, 1998, pp. 731-742.
41. A.A. Razborov, On systems of equations in a free group. Izv. Akad. Nauk SSSR, Ser. Mat. 48:779-832, 1984.
42. In Russian; English translation in: Math. USSR Izvestija, 25 (1985) 115-162.
43. K.U. Schulz, Makanin's algorithm for word equations-Two improvements and a generalization, in: K.U. Schulz (Ed.), Word Equations and Related Topics, Lecture Notes in Computer Science, vol. 572, Springer-Verlag, Berlin Heidelberg, 1991, pp. 85-150.