Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
From MaRDI portal
Publication:5246503
DOI10.1142/S0218196715400044zbMath1326.20058arXiv1310.6572MaRDI 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 algebras; Chinese monoids; finite complete rewriting systems; automaticity; automata algebras; Sylvester monoids; biautomaticity; hypoplactic monoids
68Q45: Formal languages and automata
20M05: Free semigroups, generators and relations, word problems
20M35: Semigroups in automata theory, linguistics, etc.
68Q42: Grammars and rewriting systems
20M25: Semigroup rings, multiplicative semigroups of rings
Related Items
The monoids of the patience sorting algorithm, Unnamed Item, Super jeu de taquin and combinatorics of super tableaux of type A, Coherence for plactic monoids via rewriting theory and crystal structures, Chinese syzygies by insertions, Automaticity of one-relator semigroups with length less than or equal to three, Quadratic normalization in monoids, Deciding conjugacy in sylvester monoids and other homogeneous monoids
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
