Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids

Alan J. Cain, Robert Gray, António Malheiro

Research output: Contribution to journalArticlepeer-review

9 Citations (Scopus)
11 Downloads (Pure)


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üzel Karpuz; we then construct biautomatic structures. For hypoplactic monoids, we construct finite complete rewriting systems and biautomatic structures. For sylvester monoids, which are not finitely presented, we prove that the standard presentation is an infinite complete rewriting system, and construct biautomatic structures. Consequently, the monoid algebras corresponding to monoids of these classes are automaton algebras in the sense of Ufnarovskij.
Original languageEnglish
Article number51
JournalInternational Journal of Algebra and Computation
Issue number01n02
Publication statusPublished - 3 Feb 2015


  • Chinese monoid
  • hypoplactic monoid
  • sylvester monoid
  • finite complete rewriting systems
  • automaticity
  • biautomaticity

Cite this