Complete semi-Thue systems for abelian groups (Q1087012)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3986634
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complete semi-Thue systems for abelian groups |
scientific article; zbMATH DE number 3986634 |
Statements
Complete semi-Thue systems for abelian groups (English)
0 references
1986
0 references
We show that there are infinitely many examples of finite semi-Thue systems with decidable word problem and which have no finite equivalent noetherian and confluent \((=complete)\) reduction system. These examples have a very simple algebraic structure: they are abelian groups. More precisely, we develop necessary and sufficient conditions for the existence of complete semi-Thue systems for presentations of finitely generated abelian groups.
0 references
rewriting systems
0 references
finite semi-Thue systems
0 references
decidable word problem
0 references
finitely generated abelian groups
0 references
0 references
0.9055963
0 references
0 references
0.8807251
0 references
0 references
0.8756698
0 references
0.8726553
0 references
0.86426127
0 references
