| Claudio Gutierrez. Satisfiability of equations in free groups is in PSPACE. In Proc. 32nd ACM STOC, pages 21--27. ACM Press, 2000. |
....first recognized by Rytter and Plandowski when applying Lempel Ziv encodings to the minimal solution of a word equation [27] Another important notion is the definition of an factorization of the solution being explained below. Guti errez extended Plandowski s method to the case of free groups, [10]. Thus, a non primitive recursive scheme for solving equations in free groups has been replaced by a polynomial space bounded algorithm. Hagenah and Diekert worked independently in the same direction and using some ideas of Guti errez they obtained a result which includes the presence of rational ....
....worked independently in the same direction and using some ideas of Guti errez they obtained a result which includes the presence of rational constraints. This appeared as extended abstract in [4] and also as a part of the PhD thesis of Hagenah [11] The present paper is a journal version of [4, 10]. It shows that the existential theory of equations in free groups with rational constraints is PSPACE complete. Rational constraints mean that a possible solution has to respect a specification which is given by a regular word language. The idea to consider regular constraints for word ....
[Article contains additional citation context not shown here]
Claudio Guti'errez. Satisfiability of equations in free groups is in PSPACE. In 32nd Ann. ACM Symp. on Theory of Computing (STOC'2000.
No context found.
Claudio Gutierrez. Satisfiability of equations in free groups is in PSPACE. In Proc. 32nd ACM STOC, pages 21--27. ACM Press, 2000.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC