Hostname: page-component-7b7567c8c-lpg2g Total loading time: 0 Render date: 2026-11-15T22:20:48.845Z Has data issue: false hasContentIssue false

Monoid presentations of groups by finite special string-rewritingsystems

Published online by Cambridge University Press:  15 June 2004

Duncan W. Parkes
Affiliation:
Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, England; rmt@mcs.le.ac.uk.: School of Mathematics and Statistics, University of St Andrews, St Andrews, KY16 9SS, Scotland; dparkes@mcs.st-and.ac.uk.
V. Yu. Shavrukov
Affiliation:
Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, England; rmt@mcs.le.ac.uk.: IT-Universitetet i København, Glentevej 67, 2400 København NV, Denmark; volodya@itu.dk.
Richard M. Thomas
Affiliation:
Department of Mathematics and Computer Science, University of Leicester, University Road, Leicester, LE1 7RH, England; rmt@mcs.le.ac.uk.
Get access

Abstract

We show that the class of groups whichhave 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 freegroup and finitely many finite groups),and that any groupwhich has an infinite cyclic central subgroupcan be presented by such a string-rewriting system if and only if it is thedirect product of an infinite cyclic group and a finite cyclic group.

Information

Type
Research Article
Copyright
© EDP Sciences, 2004

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable