The word problem for free partially commutative groups

DOI10.1016/S0747-7171(88)80024-5zbMath0655.20027MaRDI QIDQ1109139

S. H. Smith

Publication date: 1988

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithm; word problem; free partially commutative groups; preperfect Thue system

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q45: Formal languages and automata

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Trace monoids with some invertible generators: Two decision problems