1. Anderson, I.: On primitive sequences. Journal London Math. Soc. 42, 137–148 (1967)
2. Anderson, I.: Combinatorics of finite sets. Dover Publications, Mineola (2002)
3. Bach, E., Shallit, J.: Algorithmic Number Theory, vol. 1. MIT Press, Cambridge (1997)
4. Berstel, J., Boasson, L.: The set of Lyndon words is not context-free. Bull. EATCS 63, 139–140 (1997)
5. Constantinescu, S., Ilie, L.: Fine and Wilf’s theorem for Abelian periods. Bull. EATCS 89, 167–170 (2006)