On completeness of word reversing

DOI10.1016/S0012-365X(00)00149-7zbMath0966.05038OpenAlexW2028501336MaRDI QIDQ1591140

Patrick Dehornoy

Publication date: 12 August 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00149-7

zbMATH Keywords

Cayley graphword problemCoxeter groupmonoidsArtin groupword reversing

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Grammars and rewriting systems (68Q42)

Related Items

Some computational aspects in the work of Patrick Dehornoy, Complete positive group presentations., THE SUBWORD REVERSING METHOD, On the distance between the expressions of a permutation, ON WORD REVERSING IN BRAID GROUPS, A cancellativity criterion for presented monoids, Injective morphisms between Artin-Tits groups, Groupes de Garside, Directed Homotopy in Non-Positively Curved Spaces