The word problem for free partially commutative groups

From MaRDI portal





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.




Cited in
(26)








This page was built for publication: The word problem for free partially commutative groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1109139)