Word Equations over Graph Products

For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore, it is shown that the positive theory of a graph product of groups can be reduced to the positive theories of those factors, which commute with all other factors, and the existential theories of the remaining factors. Both results also include suitable constraints for the variables. Larger classes of constraints lead in many cases to undecidability results.

• Type: Conference
• Year: 2003
• Where: FSTTCS
• Authors: Volker Diekert, Markus Lohrey
• Keywords: Existential Theory, FSTTCS 2003, Graph Product, Weak Cancellation Condition