ABSTRACT
Enumerative combinatorics on words is itself a branch of enumerative combinatorics, centered on the simplest structure constructor since words are the same as finite sequences.
In this chapter, we have tried to cover a variety of aspects of enumerative combinatorics on words. We have focused on the problems of enumeration connected with conjugacy classes. This includes many interesting combinatorial aspects of words like Lyndon words and de Bruijn cycles. One of the highlights of the chapter is the connection between both of these concepts via the theorem of Fredericksen and Maiorana.
