Solvability of Equations in Free Partially Commutative Groups Is Decidable
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
On the Theory of One-Step Rewriting in Trace Monoids
ICALP '02 Proceedings of the 29th 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
Existential and Positive Theories of Equations in Graph Products
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
The existential theory of equations with rational constraints in free groups is PSPACE-complete
Information and Computation
Alphabetical satisfiability problem for trace equations
Acta Cybernetica
| Hi-index | 5.23 |