Contribution
Solving word equations modulo partial commutations

https://doi.org/10.1016/S0304-3975(98)00313-2Get rights and content
Under an Elsevier user license
open archive

Abstract

It is shown that it is decidable whether an equation over a free partially commutative monoid has a solution. We give a proof of this result using normal forms. Our method is a direct reduction of a trace equation system to a word equation system with regular constraints. Hereby we use the extension of Makanin's theorem on the decidability of word equations to word equations with regular constraints, which is due to Schulz.

Keywords

Word equations
Partial commutations
Traces
Word equations with regular constraints

Cited by (0)

1

The main part of this work was done during a stay of the author at the University of Stuttgart.