Singular artin monoids of finite coxeter type are automatic

Authors:
Ruth Corran;Michael Hoffmann;Dietrich Kuske;Richard M. Thomas
Affiliations:
American University of Paris, Paris, France;Dept of Computer Science, University of Leicester, Leicester, UK;-;Dept of Computer Science, University of Leicester, Leicester, UK
Venue:
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Year:
2011

Citing 6
Cited 1

Synchronized rational relations of finite and infinite words

Theoretical Computer Science - Selected papers of the International Colloquium on Words, Languages and Combinatorics, Kyoto, Japan, August 1990
Automatic semigroups

Theoretical Computer Science
Automata, Languages, and Machines

Automata, Languages, and Machines
The Book of Traces

The Book of Traces
Word Processing in Groups

Word Processing in Groups
Automatic Monoids Versus Monoids with Finite Convergent Presentations

RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications

Where automatic structures benefit from weighted automata

Algebraic Foundations in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.