Solvability of Equations in Free Partially Commutative Groups Is Decidable

@inproceedings{Diekert2001SolvabilityOE,
  title={Solvability of Equations in Free Partially Commutative Groups Is Decidable},
  author={Volker Diekert and Anca Muscholl},
  booktitle={ICALP},
  year={2001}
}
Trace monoids are well-studied objects in computer science where they serve as a basic algebraic tool for analyzing concurrent systems. The question whether the existential theory of trace equations is decidable has been solved positively in 1996. Free partially commutative groups (graph groups) generalize trace monoids in the sense that every element has… CONTINUE READING