AbstractWe give an effective characterization of the lexicographically least word in the orbit closure of the Rudin–Shapiro word w having a specified prefix. In particular, the lexicographically least word in the orbit closure of the Rudin–Shapiro word is 0w. This answers a question Allouche et al. (Theoretical Computer Science 2009)
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
Free words are elements of a free monoid, generated over an alphabet via the binary operation of con...
The lexicographically least square-free infinite word on the alphabet of non-negative integers with ...
Let t be the infinite fixed point, starting with 1, of the morphism μ:0→01, 1→10. An infinite word o...
International audienceSmooth words are connected to the Kolakoski sequence. We construct the maximal...
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoidin...
Let t be the infinite fixed point, starting with 1, of the morphism ¯ : 0 ! 01, 1 ! 10. An infinite ...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
We show that any positive integer is the least period of a factor of the Thue-Morse word. We also ch...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
Free words are elements of a free monoid, generated over an alphabet via the binary operation of con...
The lexicographically least square-free infinite word on the alphabet of non-negative integers with ...
Let t be the infinite fixed point, starting with 1, of the morphism μ:0→01, 1→10. An infinite word o...
International audienceSmooth words are connected to the Kolakoski sequence. We construct the maximal...
In previous work, Currie and Rampersad showed that the growth of the number of binary words avoidin...
Let t be the infinite fixed point, starting with 1, of the morphism ¯ : 0 ! 01, 1 ! 10. An infinite ...
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative ...
Fredricksen and Maiorana (1978) [2] prove that the concatenation of Lyndon words of length dividing ...
Thue proved that the factors occurring infinitely many times in square-free words over {0,1,2} avoid...
We show that any positive integer is the least period of a factor of the Thue-Morse word. We also ch...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
ABSTRACT. We investigate the least number of palindromic factors in an infinite word. We first consi...
We investigate the least number of palindromic factors in an infinite word. We first consider genera...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractGiven a finite or infinite word v, we consider the set M(v) of minimal forbidden factors of ...
Free words are elements of a free monoid, generated over an alphabet via the binary operation of con...