Satisfiability of equations in free groups is in PSPACE
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Equations in free semigroups with involution and their relation to equations in free groups
Theoretical Computer Science - Latin American theoretical informatics
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
An efficient algorithm for solving word equations
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Theories of HNN-Extensions and amalgamated products
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
| Hi-index | 5.23 |