The word problem for free partially commutative groups
type: Item
instance of: scholarly article
title: The word problem for free partially commutative groups
zbMATH Open document ID: 0655.20027
DOI: 10.1016/S0747-7171(88)80024-5
author: S. H. Smith
published in: Journal of Symbolic Computation
publication date: 1988-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 20F10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 4069185
zbMATH Keywords: preperfect Thue system
zbMATH Keywords: algorithm
zbMATH Keywords: word problem
zbMATH Keywords: free partially commutative groups
reviewed by: Václav Koubek
MaRDI profile type: Publication
cites work: Confluent and Other Types of Thue Systems
cites work: Rewriting systems and word problems in a free partially commutative monoid
cites work: Une généralisation des ensembles de Dyck
cites work: Q3736919
cites work: Q3771597
cites work: Some properties of commutation in free partially commutative monoids
cites work: On some equations in free partially commutative monoids
cites work: The undecidability of the preperfectness of Thue systems
cites work: Q4105657
description: scientific article; zbMATH DE number 4069185