# The rotating normal form is regular

@article{Fromentin2016TheRN, title={The rotating normal form is regular}, author={Jean Fromentin}, journal={ArXiv}, year={2016}, volume={abs/1606.08970} }

Defined on Birman-Ko-Lee monoids, the rotating normal form has strong connections with the Dehornoy's braid ordering. It can be seen as a process for selecting between all the representative words of a Birman-Ko-Lee braid a particular one, called rotating word. In this paper we construct, for all n \textgreater{} 1, a finite state automaton which recognizes the rotating words on n strands. As a consequence the language of rotating words on n strands is proved to be regular for any n… Expand

#### Figures and Topics from this paper

#### References

SHOWING 1-10 OF 12 REFERENCES

Every braid admits a short sigma-definite expression

- Mathematics
- 2011

A result by Dehornoy (1992) says that every nontrivial braid admits a σ -definite expression, defined as a braid word in which the generator σi with maximal index i appears with exponents that are… Expand

The dual braid monoid

- Mathematics
- 2001

Abstract We study a new monoid structure for Artin groups associated with finite Coxeter systems. Like the classical positive braid monoid, the new monoid is a Garside monoid. We give several… Expand

A new approach to the word and conjugacy problems in the braid groups

- Mathematics
- 1997

Abstract A new presentation of the n -string braid group B n is studied. Using it, a new solution to the word problem in B n is obtained which retains most of the desirable features of the… Expand

Groups with a complemented presentation

- Mathematics
- 1997

Abstract Let G be a group given by a presentation. We study the decomposition of the elements of G as quotients of “positive” elements (the elements of G that can be expressed without using the… Expand

Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups

- Mathematics
- 1999

It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter-type Artin groups. Here we show how to extend the results to more general groups that we call… Expand

Automatic semigroups

- Mathematics, Computer Science
- Theor. Comput. Sci.
- 2001

2-We have a group G or a semigroup S with a set of (semigroup) generators A. We have a natural mapping ! : A* " G. Various notions of classes of groups and semigroups give rise to (the possibility… Expand

Word processing in groups

- Computer Science
- 1992

This study in combinatorial group theory introduces the concept of automatic groups and is of interest to mathematicians and computer scientists and includes open problems that will dominate the research for years to come. Expand

Why are braids orderable

- Mathematics
- 2002

Environ dix ans ont passe depuis la decouverte du caractere ordonnable des groupes de tresses, et des methodes diverses ont ete proposees pour expliquer le phenomene. Le but de ce texte est de… Expand

A well-ordering of dual braid monoids

- Mathematics
- 2007

Abstract Let B n + ∗ denote the dual braid monoid on n strands, i.e., the submonoid of the braid group B n consisting of the braids that can be expressed as positive words in the Birman–Ko–Lee… Expand

Why are braids orderable?, Panoramas et Synthèses [Panoramas and Syntheses

- Why are braids orderable?, Panoramas et Synthèses [Panoramas and Syntheses
- 2002