Abstract
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 minimal solution of an equation E in free SGA is bounded by 2o(|E|). © Springer-Verlag Berlin Heidelberg 2000.
Cite
CITATION STYLE
Gutierrez, C. (2000). Equations in free semigroups with anti-involution and their relation to equations in free groups. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1776 LNCS, pp. 387–396). https://doi.org/10.1007/10719839_38
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
