Substitution invariant sturmian bisequences

The language L(u) contains infinitely many palindromes, but it need not be closed under reversal, neither recurrent nor rich as illustrated by the following example.. Example 5.6 (PE

For some applications, it is important not only to know whether a word ω has a finite or infinite index and how large this index (or critical exponent) is, but one also needs to

We compare two sets of (infinite) binary sequences whose suffixes satisfy extremal conditions: one occurs when studying itera- tions of unimodal continuous maps from the unit interval

By Theorems 1.6 and 1.7, if a Sturmian word is substitution invariant, then it is a fixed point of some primitive substitution with connected Rauzy fractals.. Let σ be an

A corollary of this characterization is that, given a morphic characteristic word, we can’t add more than two letters, if we want it to remain morphic and Sturmian, and we cannot

Let U be an unbordered word on an alphabet A and let W be a word of length 2|U | beginning in U and with the property that each factor of W of length greater than |U| is bordered..

In this paper, we give a simpler proof of this resuit (Sect, 2) and then, in Sections 3 and 4, we study the occurrences of factors and the return words in episturmian words

Now let e > 0 be arbitrary small and let p,q be two multiplicatively independent éléments of H. It remains to consider the case where H, as defined in Theorem 2.2, does not