1. Berstel, J., Karhumäki, J.: Combinatorics on words - a tutorial. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 79, 178–228 (2003)
2. Berthé, V., Karhumäki, J., Nowotka, D., Shallit, J.: Mini-workshop: combinatorics on words. Oberwolfach Rep. 7, 2195–2244 (2010).
https://doi.org/10.4171/OWR/2010/37
3. Bringmann, K.: Fine-grained complexity theory (tutorial). In: Niedermeier, R., Paul, C. (eds.) 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019), Leibniz International Proceedings in Informatics, vol. 4, pp. 1–7 (2019)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press, Cambridge (2009)
5. Dress, A.W.M., Erdős, P.L.: Reconstructing words from subwords in linear time. Ann. Comb. 8, 457–462 (2004)