The authors are interested in substitutive words (i.e., words obtained by applying a morphism of the free monoid to the iterative fixed point of some morphism of the free monoid). Cobham proved in 1968 that such a word can be obtained by a more precise construction where the first morphism above is a letter-to-letter morphism. The authors give a simpler proof of Cobham's result. They also obtain refined results for purely substitutive words and for the block-complexity of substitutive words. Please note that Reference [1] appeared: [\textit{J.-P. Allouche} and \textit{J. Shallit}, Automatic sequences. Theory, applications, generalizations. Cambridge: University Press (2003; Zbl 1086.11015)].
- On the simplification of infinite morphic words
- A characterization of substitutive sequences using return words
- Invertible substitutions on a three-letter alphabet.
- On infinite words determined by L systems
- Characterization of a word by its subwords
- Asymptotic properties of free monoid morphisms
- General framework
- Rigidity and substitutive dendric words
- Calculation of the complexities of substitutive sequences over a binary alphabet
- Two-block substitutions and morphic words
- Decidable problems in substitution shifts
- Automaticity and Parikh-Collinear Morphisms
This page was built for publication: Some properties of substitutive words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781918)
