Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
DOI10.1142/S0218196715400044zbMath1326.20058arXiv1310.6572OpenAlexW2004234796MaRDI QIDQ5246503
Robert D. Gray, Alan J. Cain, António Malheiro
Publication date: 21 April 2015
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1310.6572
monoid algebrasChinese monoidsfinite complete rewriting systemsautomaticityautomata algebrasSylvester monoidsbiautomaticityhypoplactic monoids
Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35) Grammars and rewriting systems (68Q42) Semigroup rings, multiplicative semigroups of rings (20M25)
Related Items (8)
Cites Work
- Unnamed Item
- Minimal spectrum and the radical of Chinese algebras.
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- The algebra of binary search trees
- Synchronized rational relations of finite and infinite words
- Conjugacy in monoids with a special Church-Rosser presentation is decidable
- Hopf algebra of the planar binary trees
- Noncommutative symmetric functions. IV: Quantum linear groups and Hecke algebras at \(q=0\)
- Automatic semigroups
- On the hypoplactic monoid
- Structure of Chinese algebras.
- GRÖBNER–SHIRSHOV BASIS FOR THE CHINESE MONOID
- Term Rewriting and All That
- THE CHINESE MONOID
- Automatic monoids and change of generators
- Chinese Algebras of Rank 3
This page was built for publication: Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids