J. Allouche and J. Shallit, Automatic Sequences. Theory, Applications, Generalizations, 2003.
DOI : 10.1017/cbo9780511546563

S. V. Avgustinovich, D. G. Fon-der-flaass, and A. E. Frid, Arithmetical Complexity of Infinite Words, Words, Languages & Combinatorics III, pp.51-62, 2003.
DOI : 10.1142/9789812704979_0004

J. Cassaigne, An algorithm to test if a given circular hd0l-language avoids a pattern, IFIP World Computer Congress'94, pp.459-464, 1994.

A. Frid, On uniform DOL words, STACS'98, pp.544-554, 1998.
DOI : 10.1007/BFb0028589

H. Furstenberg, Poincare recurrence and number theory In The mathematical heritage of Henri Poincare, Proceedings of Symposia in Pure Mathematics, pp.192-216, 1980.

H. Furstenberg, Recurrence in Ergodic Theory and Combinatorial Number Theory, 1981.
DOI : 10.1515/9781400855162

F. Mignosi and P. Séébold, If a d0l language is k-power-free then it is circular, Automata, Languages and Programming, pp.507-518, 1993.