Binary patterns in binary cube-free words: Avoidability and growth

In [1], Ambroˇz, Frid, Mas´akov´ a and Pelantov´ a estimated the number of all words arising from three- interval exchange, which continues the same line since Sturmian words

This paper reports progress on a similar effort about characterising the set of finite words over an alphabet {a, b} which are Petri net solvable, i.e., for which a place/transition

when 2-overlap-free binary infinite partial words can contain infinitely many holes. In [6], it is proved that the occurrences of 22 are the only squares in the word

An infinite word is an infinite Lyndon word if it is smaller, with respect to the lexicographic order, than all its proper suffixes, or equivalently if it has infinitely many

In Section 4 we introduce the concept of 0-limited square property (a word has this property if the squares it contains have a particular form) to prove that, for every integer k,

In this section we will prove the existence of a ternary infinite 64-abelian square- free word by taking a suitable morphic image of an infinite abelian square-free word..

In [1], Ambroˇ z, Frid, Mas´ akov´ a and Pelantov´ a estimated the number of all words arising from three- interval exchange, which continues the same line since Sturmian words

Algorithm 2 takes as input any directive bi-sequence of length n for a two-letter alphabet, normalized or not, and computes, in linear time with respect to the length of the