The word problem for free partially commutative groups (Q1109139)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The word problem for free partially commutative groups |
scientific article; zbMATH DE number 4069185
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The word problem for free partially commutative groups |
scientific article; zbMATH DE number 4069185 |
Statements
The word problem for free partially commutative groups (English)
0 references
1988
0 references
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.
0 references
preperfect Thue system
0 references
algorithm
0 references
word problem
0 references
free partially commutative groups
0 references
