The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete

Authors:
Volker Diekert;Claudio Gutiérrez;Christian Hagenah
Affiliations:
-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 12
Cited 1

Complexity of Makanin's algorithm

Journal of the ACM (JACM)
Satisfiability of word equations with constants is in NEXPTIME

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Solving word equations modulo partial commutations

Theoretical Computer Science
Satisfiability of equations in free groups is in PSPACE

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Monadic Simultaneous Rigid E-Unification and Related Problems

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
The Word Matching Problem Is Undecidable For Finite Special String-Rewriting Systems That Are Confluent

ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Application of Lempel-Ziv Encodings to the Solution of Words Equations

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups

LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Makanin's Algorithm for Word Equations - Two Improvements and a Generalization

IWWERT '90 Proceedings of the First International Workshop on Word Equations and Related Topics
The Security of Individual RSA Bits

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Satisfiability of Word Equations with Constants is in PSPACE

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for natural proof systems

SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science

Existential and Positive Theories of Equations in Graph Products

STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper extends extends known results on the complexity of word equations and equations in free groups in order to include the presence of rational constraints, i.e., such that a possible solution has to respect a specification given by a rational language. Our main result states that the existential theory of equations with rational constraints in free groups is PSPACE-complete.