Sturmian images of non Sturmian words and standard morphisms
Sturmian sequences, which can be defined as codings of irrational rotations on the unit circle, and morphic sequences, which are obtained by taking the pointwise image of iterative fixed points of morphims of the free monoid, are two families of ``simple sequences, in the sense that they are somehow ``close (in distinct ways) to periodic sequences. It is thus tempting to search for sequences that are both Sturmian and morphic. There are quite a few papers on this subject (see, e.g., the reviews of the papers [\textit{L. Peng} and \textit{B. Tan}, Discrete Math. Theor. Comput. Sci. 13, No. 2, 63--68 (2011; Zbl 1283.68276); \textit{V. Berthé} et al., Theor. Inform. Appl. 41, No. 3, 329--349 (2007; Zbl 1140.11014)] and the references therein). The author of the paper under review revisits the subject by proving interesting new results, among which we point out the following somewhat unexpected statements: -- If the image of an infinite binary sequence by a morphism from the free monoid on two letters to itself is Sturmian, then the morphism is Sturmian (the previously known result needed the assumption that the initial sequence was itself Sturmian). Furthermore the initial sequence must be the concatenation of some letter to some power and of a Sturmian sequence. -- If a Sturmian sequence is the image of the iterative fixed point of some morphism defined on the free monoid on two letters, then the two involved morphisms must be Sturmian. Several other results are proved in the paper, including a characterization of morphisms that send non-Sturmian sequences to Sturmian sequences.
- Periodicity of morphic words
- Sequences generated by infinitely iterated morphisms
- Invertible substitutions and Sturmian sequences.
- On Sturmian sequences which are invariant under some substitutions
- scientific article; zbMATH DE number 1343488
- Substitution invariant Sturmian bisequences
- Trajectories of rotations
- Sturmian morphisms and Rauzy's rules
- Recursively renewable words and coding of irrational rotations
- Morphic sequences versus automatic sequences
- Automatic Sequences
- Completing a combinatorial proof of the rigidity of Sturmian words generated by morphisms
- Conjugacy and episturmian morphisms.
- Conjugation of standard morphisms and a generalization of singular words
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 1333603 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Invariance properties of Sturmian words
- Mots sans carre et morphismes iterés
- On the conjugation of standard morphisms
- Sequences generated by infinitely iterated morphisms
- Sturmian morphisms and Rauzy's rules
- Substitutions in dynamics, arithmetics and combinatorics
- The equality problem for purely substitutive words
- Uniform tag sequences
- Sturmian morphisms
- Sturmian morphisms and -words
- Column representation of Sturmian words in cellular automata
- On the Stern-Brocot expansion of real numbers
- Morphic words, Beatty sequences and integer images of the Fibonacci language
- Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words
- On Sturmian sequences which are invariant under some substitutions
- scientific article; zbMATH DE number 17555 (Why is no real title available?)
- scientific article; zbMATH DE number 1333603 (Why is no real title available?)
- Developments in Language Theory
This page was built for publication: Sturmian images of non Sturmian words and standard morphisms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1698732)
