The word problem for free partially commutative groups
The aim of this paper is to prove the two following facts: every free partially commutative group can be considered as a monoid given by a preperfect Thue system and there exists a linear time consuming algorithm solving the word problem in the free partially commutative groups.
scientific article; zbMATH DE number 4069185