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

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

Volumn 2010, Issue , 2001, Pages 170-182

  Diekert, Volker ^a   Gutiérrez, Claudio ^b   Hagenah, Christian ^a  

^a UNIVERSITY OF STUTTGART   (Germany)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Equations; Formal languages; Free group; Regular language

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

EQUATIONS; EXISTENTIAL THEORY OF EQUATIONS; FREE GROUPS; PSPACE-COMPLETE; RATIONAL CONSTRAINT; RATIONAL LANGUAGES; WORD EQUATIONS;

FORMAL LANGUAGES;

EID: 84957080926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_15     Document Type: Conference Paper

References (21)

1. M. Benois. Parties rationelles du groupe libre. C. R. Acad. Sci. Paris, Sér. A, 269:1188-1190, 1969.
2. J. Berstel. Transductions and context-free languages. Teubner Studienbücher, Stuttgart, 1979.
3. V. Diekert. Makanin's Algorithm. In M. Lothaire, Algebraic Combinatorics on Words. Cambridge University Press, 2001. To appear. A preliminary version is on the web: http://www-igm.univ-mlv.fr/~berstel/Lothaire/index.html.
4. V. Diekert and M. Lohrey. A note on the existential theory of plain groups. Submitted for publication, 2000.
5. V. Diekert, Yu. Matiyasevich, and A. Muscholl. Solving word equations modulo partial commutations. Th. Comp. Sc., 224:215-235, 1999. Special issue of LFCS'97.
6. Yu. Gurevich and A. Voronkov. Monadic simultaneous rigid E-unification and related problems. In P. Degano et al., editor, Proc. 24th ICALP, Bologna (Italy) 1997, number 1256 in Lect. Not. Comp. Sc., pages 154-165. Springer, 1997.
7. C. Gutiérrez. Satisfiability of word equations with constants is in exponential space. In Proc. of the 39th Ann. Symp. on Foundations of Computer Science, FOCS'98, pages 112-119, Los Alamitos, California, 1998. IEEE Computer Society Press.
8. C. Gutiérrez. Equations in free semigroups with anti-involution and their relation to equations in free groups. In G. H. Gonnet et al., editor, Proc. Lat. Am. Theor. Inf., LATIN'2000, number 1776 in LNCS, pages 387-396. Springer, 2000.
9. C. Gutiérrez. Satisfiability of equations in free groups is in PSPACE. In 32nd ACM Symp. on Theory of Computing (STOC'2000), pages 21-27. ACM Press, 2000.
10. Ch. Hagenah. Gleichungen mit regulären Randbedingungen über freien Gruppen. PhD-thesis, Institut für Informatik, Universität Stuttgart, 2000.
11. A. Kościelski and L. Pacholski. Complexity of Makanin's algorithm. Journal of the Association for Computing Machinery, 43(4):670-684, 1996. Preliminary version in Proc. of the 31st Ann. Symp. on Foundations of Computer Science, FOCS 90, pages 824-829, Los Alamitos, 1990. IEEE Computer Society Press.
12. D. Kozen. Lower bounds for natural proof systems. In Proc. of the 18th Ann. Symp. on Foundations of Computer Science, FOCS 77, pages 254-266, Providence, Rhode Island, 1977. IEEE Computer Society Press.
13. G. S. Makanin. The problem of solvability of equations in a free semigroup. Math. Sbornik, 103:147-236, 1977. English transl. in Math. USSR Sbornik 32 (1977).
14. G. S. Makanin. Equations in a free group. Izv. Akad. Nauk SSR, Ser. Math. 46:1199-1273, 1983. English transl. in Math. USSR Izv. 21 (1983).
15. G. S. Makanin. Decidability of the universal and positive theories of a free group. Izv. Akad. Nauk SSSR, Ser. Mat. 48:735-749, 1984. In Russian; English translation in: Math. USSR Izvestija, 25, 75-88, 1985.
16. P. Narendran and F. Otto. The word matching problem is undecidable for finite special string-rewriting systems that are confluent. In P. Degano et al., editor, Proc. 24th ICALP, Bologna (Italy) 1997, number 1256 in Lect. Not. Comp. Sc., pages 638-648. Springer, 1997.
17. W. Plandowski. Satisfiability of word equations with constants is in NEXPTIME. In Proc. 31st Ann. Symp. on Theory of Computing, STOC'99, pages 721-725. ACM Press, 1999.
18. W. Plandowski. Satisfiability of word equations with constants is in PSPACE. In Proc. of the 40th Ann. Symp. on Foundations of Computer Science, FOCS 99, pages 495-500. IEEE Computer Society Press, 1999.
19. W. Plandowski and W. Rytter. Application of Lempel-Ziv encodings to the solution of word equations. In Kim G. Larsen et al., editors, Proc. of the 25th ICALP, 1998, number 1443 in Lect. Not. Comp. Sc., pages 731-742. Springer, 1998.
20. W. Rytter. On the complexity of solving word equations. Lecture given at the 16th British Colloquium on Theoretical Computer Science, Liverpool (http://www.csc.liv.ac.uk/~bctcs16/abstracts.html), 2000.
21. K. U. Schulz. Makanin's algorithm for word equations - Two improvements and a generalization. In Klaus U. Schulz, editor, Word Equations and Related Topics, number 572 in Lect. Not. Comp. Sc., pages 85-150. Springer, 1991.