We show that, with the exception of the words $a^2ba^2$ and $b^2ab^2$, all(finite or infinite) binary patterns in the Prouhet-Thue-Morse sequence canactually be found in that sequence as segments (up to exchange of letters inthe infinite case). This result was previously attributed to unpublished workby D. Guaiana and may also be derived from publications of A. Shur onlyavailable in Russian. We also identify the (finitely many) finite binarypatterns that appear non trivially, in the sense that they are obtained byapplying an endomorphism that does not map the set of all segments of thesequence into itself
AbstractIn a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorando...
AbstractGiven two words u and υ, the binomial coefficient (uυ) is the number of ways υ appears as a ...
AbstractSpecial finite binary sequences are tested for pseudorandomness. As measures of pseudorandom...
AbstractWe show that the Morse sequence is the only infinite binary sequence without overlapping fac...
AbstractLet {S(n)}n⩾0 be an infinite sequence on {+1, −1}. In a previous paper, Morton and Mourant (...
AbstractIn 1912, the Norwegian mathematician Axel Thue was the first to describe an overlap-free bin...
An infinite sequence on two symbols is constructed with no three adjacent identical blocks of symbol...
AbstractThe following is proved: (1) There exists an infinite binary sequence having no triple repet...
International audienceThe main subject of this paper are binary pattern sequences, that is, sequence...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractAssume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable sy...
In this paper, it is shown that if k≥3, any finite k-symbols pattern whose lengthis greater than 1 c...
We consider the position and number of occurrences of squares in the Thue-Morse sequence, and show t...
We consider strings which are succinctly described. The description is in terms of straight-line pro...
Abstract. The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is per...
AbstractIn a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorando...
AbstractGiven two words u and υ, the binomial coefficient (uυ) is the number of ways υ appears as a ...
AbstractSpecial finite binary sequences are tested for pseudorandomness. As measures of pseudorandom...
AbstractWe show that the Morse sequence is the only infinite binary sequence without overlapping fac...
AbstractLet {S(n)}n⩾0 be an infinite sequence on {+1, −1}. In a previous paper, Morton and Mourant (...
AbstractIn 1912, the Norwegian mathematician Axel Thue was the first to describe an overlap-free bin...
An infinite sequence on two symbols is constructed with no three adjacent identical blocks of symbol...
AbstractThe following is proved: (1) There exists an infinite binary sequence having no triple repet...
International audienceThe main subject of this paper are binary pattern sequences, that is, sequence...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
AbstractAssume a finite alphabet of constant symbols and a disjoint infinite alphabet of variable sy...
In this paper, it is shown that if k≥3, any finite k-symbols pattern whose lengthis greater than 1 c...
We consider the position and number of occurrences of squares in the Thue-Morse sequence, and show t...
We consider strings which are succinctly described. The description is in terms of straight-line pro...
Abstract. The Morse-Hedlund Theorem states that a bi-infinite sequence η in a finite alphabet is per...
AbstractIn a series of papers Mauduit and Sárközy (partly with coauthors) studied finite pseudorando...
AbstractGiven two words u and υ, the binomial coefficient (uυ) is the number of ways υ appears as a ...
AbstractSpecial finite binary sequences are tested for pseudorandomness. As measures of pseudorandom...