Output details
11 - Computer Science and Informatics
University of Leicester
Article title
On the automaticity of singular Artin monoids of finite type
Type
D - Journal article
Title of journal
International Journal of Computer Mathematics
Article number
-
Volume number
90
Issue number
6
First page of article
1197
ISSN of journal
0020-7160
Year of publication
2013
URL
-
Number of additional authors
3
Additional information
<10>Braid and Artin groups are of fundamental importance in combinatorial group theory. There are many deep unsolved problems concerning them. One fruitful approach has been to study various classes of associated monoids. The singular braid monoids were introduced in order to study Vassiliev
knot invariants and these generalize naturally to singular Artin monoids. While Artin groups of finite type are automatic, the question for the corresponding singular Artin monoids was open. The automaticity of all such monoids is established and, as part of this, an entirely new criterion for demonstrating automaticity is introduced. It appeared in the LATA'11 special issue.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
1
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
