1. Growth problems for avoidable words;Baker;Theoretical Computer Science,1989
2. Unavoidable patterns;Cassaigne,2002
3. Combinatorics of Words;Choffrut,1997
4. Finding a homomorphism between two words is NP-complete;Ehrenfeucht;Information Processing Letters,1979
5. The unambiguity of segmented morphisms;Freydenberger,2007