1988
DOI: 10.1051/ita/1988220100931
|View full text |Cite
|
Sign up to set email alerts
|

Commutativity in groups presented by finite Church-Rosser Thue systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

1988
1988
2023
2023

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…Early progress was swift. Diekert [4] (see also [11]) proved that that the family of groups admitting presentation by finite convergent length-reducing rewriting systems is properly contained within the family of virtually-free groups; Avenhaus, Madlener and Otto [1] proved that the family of groups admitting presentation by finite convergent length-reducing rewriting systems in which each rule has a left-hand-side of length two is exactly the family of plain groups (a group is plain if it isomorphic to a free product of finitely-many factors, with each factor a finite group or an infinite cyclic group); an explicit construction (described in Section 2.1) shows that any plain group admits presentation by a finite convergent length-reducing rewriting system. From such results the plain groups emerged as the likely family of groups presented by finite convergent length-reducing rewriting systems.…”
Section: Introductionmentioning
confidence: 99%
“…Early progress was swift. Diekert [4] (see also [11]) proved that that the family of groups admitting presentation by finite convergent length-reducing rewriting systems is properly contained within the family of virtually-free groups; Avenhaus, Madlener and Otto [1] proved that the family of groups admitting presentation by finite convergent length-reducing rewriting systems in which each rule has a left-hand-side of length two is exactly the family of plain groups (a group is plain if it isomorphic to a free product of finitely-many factors, with each factor a finite group or an infinite cyclic group); an explicit construction (described in Section 2.1) shows that any plain group admits presentation by a finite convergent length-reducing rewriting system. From such results the plain groups emerged as the likely family of groups presented by finite convergent length-reducing rewriting systems.…”
Section: Introductionmentioning
confidence: 99%