Singular Artin Monoids of Finite Coxeter Type Are Automatic

DOI10.1007/978-3-642-21254-3_19zbMath1295.20062OpenAlexW22557251MaRDI QIDQ3004584

No author found.

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

zbMATH Keywords

finite automatatransducersnormal form theoremsCoxeter graphsrational relationsautomatic monoidsautomatic semigroupspositive singular Artin monoids

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) 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)

Related Items (4)

Automaticity of one-relator semigroups with length less than or equal to three ⋮ 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 Gröbner-Shirshov bases for plactic algebras and biautomatic structures for plactic monoids. ⋮ Where Automatic Structures Benefit from Weighted Automata

This page was built for publication: Singular Artin Monoids of Finite Coxeter Type Are Automatic