On the automaticity of singular Artin monoids of finite type

DOI10.1080/00207160.2012.734812zbMath1293.20055OpenAlexW2035319530MaRDI QIDQ2855750

No author found.

Publication date: 22 October 2013

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2012.734812

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)

Cites Work

• Unnamed Item
• Synchronized rational relations of finite and infinite words
• Artin groups of finite type are biautomatic
• A geometric characterization of automatic semigroups
• Automatic groups and amalgams
• Link invariants of finite type and perturbation theory
• A note on words in braid monoids
• Notions of automaticity in semigroups.
• Automatic semigroups
• The proof of Birman's conjecture on singular braid monoids.
• A normal form for a class of monoids including the singular braid monoids
• Combinatorial problems of commutation and rearrangements
• Artin-Gruppen und Coxeter-Gruppen
• On the singular braid monoid
• BIRMAN'S CONJECTURE IS TRUE FOR I₂(p)
• New points of view in knot theory
• On Singular Artin Monoids and Contributions to Birman's Conjecture
• The Natural Embedding of Positive Singular Artin Monoids

This page was built for publication: On the automaticity of singular Artin monoids of finite type