Rewriting Systems and Embedding of Monoids in Groups

DOI10.1515/GCC.2009.131zbMath1180.20047arXiv0804.1206OpenAlexW3101377178MaRDI QIDQ3617419

Fabienne Chouraqui

Publication date: 23 March 2009

Published in: Groups – Complexity – Cryptology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0804.1206

zbMATH Keywords

right angled Artin groupscomplete rewriting systemsembeddings of monoids in groupspositive presentationspositive rulesright angled Artin monoids

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free semigroups, generators and relations, word problems (20M05) Braid groups; Artin groups (20F36) Grammars and rewriting systems (68Q42)

Related Items (4)

The word problem for one-relation monoids: a survey ⋮ Folding of set-theoretical solutions of the Yang-Baxter equation. ⋮ Garside Groups and Yang–Baxter Equation ⋮ Confluence of algebraic rewriting systems

Cites Work

• A complete proof of correctness of the Knuth-Bendix completion algorithm
• Graph groups are biautomatic
• Algorithms and geometry for graph products of groups
• Artin monoids inject in their groups
• Term rewriting for the conjugacy problem and the braid groups
• SMALL CANCELLATION CONDITIONS AND EMBEDDABILITY OF SEMIGROUPS IN GROUPS
• EMBEDDING SEMIGROUPS INTO GROUPS, AND THE ASPHERICITY OF SEMIGROUPS

This page was built for publication: Rewriting Systems and Embedding of Monoids in Groups