Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups [chapter]

Claudio Gutiérrez
2000 Lecture Notes in Computer Science  
The main result of the paper is the reduction of the problem of satisfiability of equations in free groups to the satisfiability of equations in free semigroups with anti-involution (SGA), by a non-deterministic polynomial time transformation. A free SGA is essentially the set of words over a given alphabet plus an operator which reverses words. We study equations in free SGA, generalizing several results known for equations in free semigroups, among them that the exponent of periodicity of a
more » ... nimal solution of an equation E in free SGA is bounded by 2 O(|E|) .
doi:10.1007/10719839_38 fatcat:c5htkei2qbgstobto46qjapt6y