A set of words X is called unavoidable on a given alphabet A if every infinite word on A has a factor in X. For k, q ≥ 1, let c(k, q) be the number of conjugacy classes of words of length k on q letters. An unavoidable set of words of length k on q symbols has at least c(k, q) elements. We show that for any k, q ≥ 1 there exists an unavoidable set of words of length k on q symbols having c(k, q) elements.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.