1. A. Ya. Belov and A. L. Chernyat’ev, “Words with Low Complexity and Interval Exchange Transformations,” Usp. Mat. Nauk. 63(1), 159–160 (2008) [Russian Math. Surv. 63 (1), 158–160 (2008)].
2. A. E. Frid, “On Graphs of Subwords of DOL-Sequences,” Diskret. Anal. Issled. Oper., Ser. 1, 6(4), 92–103 (1999).
3. A. Aberkane, “Words Whose Complexity Satisfies lim p(n)/n = 1,” Theor. Comput. Sci. 307(1), 31–46 (2003).
4. J. Cassaigne, “Sequences with Grouped Factors,” in Developments in Language Theory III (DLT’97) (Aristote Univ. Thessaloniki, Thessaloniki, 1998), pp. 211–222.
5. G. Rauzy, “Suitesá termes dans un alphabet fini,” Seminar on Number Theory, 1982–1983, Exp. No. 25 (Univ. Bordeaux I, Talence, 1983), p. 16.