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 > 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 > 1.