Skip to main content
Article thumbnail
Location of Repository

Monoid presentations of groups by finite special string-rewriting systems

By Duncan W. Parkes, V. Yu Shavrukov and Richard M. Thomas

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

Year: 2004
DOI identifier: 10.1051/ita:2004012
OAI identifier: oai:lra.le.ac.uk:2381/1844
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://hdl.handle.net/2381/184... (external link)
  • http://www.rairo-ita.org/artic... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.