Please use this identifier to cite or link to this item:
|Title:||Monoid presentations of groups by finite special string-rewriting systems|
|Authors:||Parkes, Duncan W.|
Shavrukov, V. Yu
Thomas, Richard M.
|Citation:||RAIRO Theoretical Informatics and Applications, 2004, 38, pp.245-256|
|Abstract:||We show that the class of groups which have monoid presentations by means of finite special [λ]-confluent string-rewriting systems strictly contains the class of plain groups (the groups which are free products of a finitely generated free group and finitely many finite groups), and that any group which has an infinite cyclic central subgroup can be presented by such a string-rewriting system if and only if it is the direct product of an infinite cyclic group and a finite cyclic group.|
|Appears in Collections:||Published Articles, Dept. of Computer Science|
Files in This Item:
There are no files associated with this item.
Items in LRA are protected by copyright, with all rights reserved, unless otherwise indicated.