Rewriting systems and embedding of monoids in groups

Research output: Contribution to journalArticlepeer-review


In this paper, a connection between rewriting systems and embedding of monoids in groups is found. We show that if a group with a positive presentation has a complete rewriting system R that satisfies the condition that each rule in R with positive left-hand side has a positive right-hand side, then the monoid presented by the subset of positive rules from R embeds in the group. As an example, we give a simple proof that right angled Artin monoids embed in the corresponding right angled Artin groups. This is a special case of the well-known result of Paris that Artin monoids embed in their groups.

Original languageEnglish
Pages (from-to)131-140
Number of pages10
JournalGroups, Complexity, Cryptology
Issue number1
StatePublished - Apr 2009
Externally publishedYes

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Rewriting systems and embedding of monoids in groups'. Together they form a unique fingerprint.

Cite this