A characterization of overlap-free morphisms
Discrete Applied Mathematics
Subword complexity of a generalized Thue-Morse word
Information Processing Letters
On the conjugation of standard morphisms
MFCS '96 Selected papers from the 21st symposium on Mathematical foundations of computer science
Characterization of test-sets for overlap-free morphisms
Discrete Applied Mathematics
No iterated morphism generates any Arshon sequence of odd order
Discrete Mathematics
There are no iterated morphisms that define the Arshon sequence and the σ-sequence
Journal of Automata, Languages and Combinatorics
Overlap-free morphisms and finite test-sets
Discrete Applied Mathematics
On stabilizers of infinite words
Theoretical Computer Science
| Hi-index | 0.00 |
In 1912, the Norwegian mathematician Axel Thue was the first to describe an overlapfree binary infinite word. This word was generated by a morphism which is called, since the works of Morse, the Thue-Morse morphism.Here we study morphisms, generalizing the Thue-Morse morphism in the case of alphabets with more than two letters, which are obtained from a construction made by Prouhet in 1851. We examine in which case these morphisms are overlap-free and prove that the Prouhet words they generate are rigid. We also give a link with the construction realized by Arshon in 1937, proving in particular that the n-letter Arshon word is generated by morphism if and only if n is an even number. These words are also rigid.