Two-block substitutions and morphic words
نویسندگان
چکیده
We consider in general two-block substitutions and their fixed points. prove that some of them have a simple structure: points are morphic sequences. Others intrinsically more complex, such as the Kolakoski sequence. this for Thue-Morse sequence base 3/2.
منابع مشابه
Extremal words in morphic subshifts
Given an infinite word x over an alphabet A, a letter b occurring in x, and a total order σ on A, we call the smallest word with respect to σ starting with b in the shift orbit closure of x an extremal word of x. In this paper we consider the extremal words of morphic words. If x = g(fω(a)) for some morphisms f and g, we give two simple conditions on f and g that guarantees that all extremal wo...
متن کاملMaximal Blocks in Morphic and Automatic Words
Let w be a morphic word over a finite alphabet Σ, and let ∆ be a subalphabet. We study the behavior of maximal blocks of ∆ letters in w, and prove the following: let (ik, jk) denote the starting and ending positions, respectively, of the k’th maximal ∆-block in w. Then lim supk→∞(jk/ik) is algebraic if w is morphic, and rational if w is automatic. As a results, we show that the same holds if (i...
متن کاملAlmost Rich Words as Morphic Images of Rich Words
We focus on Θ-rich and almost Θ-rich words over a finite alphabet A, where Θ is an involutive antimorphism over A∗. We show that any recurrent almost Θ-rich word u is an image of a recurrent Θ′-rich word under a suitable morphism, where Θ′ is also an involutive antimorphism. Moreover, if the word u is uniformly recurrent, we show that Θ′ can be set to the reversal mapping. We also treat one spe...
متن کاملA little more about morphic Sturmian words
Among Sturmian words, some of them are morphic, i.e. fixed point of a non-identical morphism on words. Berstel and Séébold (1993) have shown that if a characteristic Sturmian word is morphic, then it can be extended by the left with one or two letters in such a way that it remains morphic and Sturmian. Yasutomi (1997) has proved that these were the sole possible additions and that, if we cut th...
متن کاملOn the Periodicity of Morphic Words
Given a morphism h prolongable on a and an integer p, we present an algorithm that calculates which letters occur infinitely often in congruent positions modulo p in the infinite word h(a). As a corollary, we show that it is decidable whether a morphic word is ultimately p-periodic. Moreover, using our algorithm we can find the smallest similarity relation such that the morphic word is ultimate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Mathematics
سال: 2023
ISSN: ['1090-2074', '0196-8858']
DOI: https://doi.org/10.1016/j.aam.2023.102536