Singular Artin monoids of finite Coxeter type are automatic.
DOI10.1007/978-3-642-21254-3_19zbMATH Open1295.20062OpenAlexW22557251MaRDI QIDQ3004584FDOQ3004584
Authors:
Publication date: 3 June 2011
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-21254-3_19
Recommendations
finite automatatransducersnormal form theoremsCoxeter graphsrational relationsautomatic monoidsautomatic semigroupspositive singular Artin monoids
Formal languages and automata (68Q45) Braid groups; Artin groups (20F36) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Free semigroups, generators and relations, word problems (20M05)
Cited In (9)
- On the automaticity of singular Artin monoids of finite type.
- Title not available (Why is that?)
- Where automatic structures benefit from weighted automata
- Automaticity of one-relator semigroups with length less than or equal to three
- An asymmetric generalisation of Artin monoids.
- Conjugacy in singular Artin monoids
- Finite Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids.
- Crystal monoids \& crystal bases: rewriting systems and biautomatic structures for plactic monoids of types \(A_{n}\), \(B_{n}\), \(C_{n}\), \(D_{n}\), and \(G_{2}\)
- Finite quotients of singular Artin monoids and categorification of the desingularization map
This page was built for publication: Singular Artin monoids of finite Coxeter type are automatic.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004584)
