Sciweavers

89
Voted
FSTTCS
2003
Springer
15 years 2 months ago
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...
Volker Diekert, Markus Lohrey