RAIRO-Theor. Inf. Appl.
Volume 38, Number 3, July-September 2004
|Page(s)||245 - 256|
|Published online||15 June 2004|
Monoid presentations of groups by finite special string-rewriting systems
Department of Mathematics and Computer
University of Leicester,
University Road, Leicester, LE1 7RH, England;
2 : School of Mathematics and Statistics, University of St Andrews, St Andrews, KY16 9SS, Scotland; email@example.com.
3 : IT-Universitetet i København, Glentevej 67, 2400 København NV, Denmark; firstname.lastname@example.org.
Accepted: 19 March 2004
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.
Mathematics Subject Classification: 20E06 / 20F05 / 20F10 / 68Q42
Key words: Group / monoid presentation / Cayley graph / special string-rewriting system / word problem.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.