  In this paper, we study the generating function of cyclically fully
commutative elements in Coxeter groups, which are elements such that any cyclic
shift of theirs reduced decompositions remains a reduced expression of a fully
commutative element. By designing a finite state automaton recognizing reduced
expressions of cyclically fully commutative elements, we can show that the
aforementioned generating series is always rational.
