A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
2015
International journal of algebra and computation
This paper studies complete rewriting systems and biautomaticity for three interesting classes of finite-rank homogeneous monoids: Chinese monoids, hypoplactic monoids, and sylvester monoids. For Chinese monoids, we first give new presentations via finite complete rewriting systems, using more lucid constructions and proofs than those given independently by Chen & Qui and G\"uzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting
doi:10.1142/s0218196715400044
fatcat:3igjlhwmezh2rivpnnttcl6tiy