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
The Book of Traces
Confluence problems for trace rewriting systems
Information and Computation
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
The Existential Theory of Equations with Rational Constraints in Free Groups is PSPACE-Complete
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
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
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
| Hi-index | 0.00 |
We prove that the existential theory of equations with normalized rational constraints in a fixed graph product of finite monoids, free monoids, and free groups is PSPACE-complete. Under certain restrictions this result also holds if the graph product is part of the input. As the second main result we prove that the positive theory of equations with recognizable constraints in graph products of finite and free groups is decidable.