%0 DATA
%A Robert, Mercas
%A Pascal, Ochem
%A Alexey V., Samsonov
%A Arseny M., Shur
%D 2017
%T Binary patterns in binary cube-free words: avoidability and growth
%U https://repository.lboro.ac.uk/articles/Binary_patterns_in_binary_cube-free_words_avoidability_and_growth/9402065
%2 https://repository.lboro.ac.uk/ndownloader/files/17018630
%K untagged
%X The avoidability of binary patterns by binary cube-free words is investigated and the exact bound between unavoidable and avoidable patterns is found. All avoidable patterns are shown to be D0L-avoidable. For avoidable patterns, the growth rates of the avoiding languages are studied. All such languages, except for the overlap-free language, are proved to have exponential growth. The exact growth rates of languages avoiding minimal avoidable patterns are approximated through computer-assisted upper bounds. Finally, a new example of a pattern-avoiding language of polynomial growth is given.