Singular Artin Monoids of Finite Coxeter Type Are Automatic

被引：0
|
作者：
Corran, Ruth [1 ]
Hoffmann, Michael [2 ]
Kuske, Dietrich [3 ]
Thomas, Richard M. [2 ]
机构：
[1] Amer Univ Paris, Paris, France
[2] Univ Leicester, Dept Comp Sci, Leicester, Leics, England
[3] Tech Univ Ilmenau, Ilmenau, Germany
来源：
LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS | 2011年 / 6638卷
基金：
英国工程与自然科学研究理事会;
关键词：
BIRMANS CONJECTURE; BRAID MONOIDS; SEMIGROUPS; WORDS;
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
We consider the positive singular and the singular Artin monoids of finite type. These have been the subject of a great deal of recent research and the main purpose of this paper is to prove that these monoids are automatic. In order to do this we establish a new criterion for proving monoids automatic that may be of independent interest.
引用
收藏
页码：250 / +
页数：2
相关论文
共 50 条
12345