Satisfiability of word equations with constants is in PSPACE

We prove that satisfiability problem for word equations is in PSPACE.

[1]  M. Lothaire.  Makanin's Algorithm , 2002 .

[2]  Wojciech Plandowski,et al.  The Complexity of the Morphism Equivalence Problem for Context-Free Languages , 1995 .

[3]  G. Makanin.  The Problem of Solvability of Equations in a Free Semigroup , 1977 .

[4]  Wojciech Plandowski.  Satisfiability of word equations with constants is in NEXPTIME , 1999, STOC '99.

[5]  Wojciech Plandowski,et al.  Application of Lempel-Ziv Encodings to the Solution of Words Equations , 1998, ICALP.

[6]  Wojciech Plandowski,et al.  Testing Equivalence of Morphisms on Context-Free Languages , 1994, ESA.

[7]  Wojciech Plandowski,et al.  The expressibility of languages and relations by word equations , 1997, JACM.

[8]  Leszek Pacholski,et al.  Complexity of Makanin's algorithm , 1996, JACM.

[9]  Klaus U. Schulz.  Word Equations and Related Topics , 1990, Lecture Notes in Computer Science.

[10]  J. Howie.  COMBINATORICS ON WORDS (Encyclopedia of Mathematics and Its Applications, 17) , 1984 .

[11]  Habib Abdulrab,et al.  Solving Word Equations , 1989, J. Symb. Comput..

[12]  Habib Abdulrab.  Résolution d'équations sur les mots : étude et implémentation Lisp de l'algorithme de Makanin , 1987 .

[13]  Claudio Gutiérrez.  Satisfiability of word equations with constants is in exponential space , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[14]  M. Lothaire.  Combinatorics on words: Bibliography , 1997 .

[15]  Klaus U. Schulz,et al.  Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.

[16]  Joxan Jaffar.  Minimal and complete word unification , 1990, JACM.

[17]  Marcus Schaefer,et al.  Recognizing string graphs in NP , 2002, STOC '02.

[18]  Paliath Narendran,et al.  Unification Theory , 2001, Handbook of Automated Reasoning.

[19]  Franz Baader,et al.  Unification theory , 1986, Decis. Support Syst..

[20]  Dan Suciu,et al.  Journal of the ACM , 2006 .

[21]  Dana Angluin,et al.  Finding patterns common to a set of strings (Extended Abstract) , 1979, STOC.