Fibonacci morphisms and Sturmian words
From MaRDI portal
Publication:1177169
DOI10.1016/0304-3975(91)90383-DzbMath0737.68068MaRDI QIDQ1177169
Publication date: 26 June 1992
Published in: Theoretical Computer Science (Search for Journal in Brave)
Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05)
Related Items (31)
The structure of invertible substitutions on a three-letter alphabet ⋮ Conjugacy of morphisms and Lyndon decomposition of standard Sturmian words ⋮ Quasiperiodic and Lyndon episturmian words ⋮ Fixed points of Sturmian morphisms and their derivated words ⋮ Quasiperiodic Sturmian words and morphisms ⋮ Random generation of finite Sturmian words ⋮ On Sturmian substitutions closed under derivation ⋮ On the conjugation of standard morphisms ⋮ Conjugacy and episturmian morphisms. ⋮ Some properties of the factors of Sturmian sequences. ⋮ Invertible substitutions and Sturmian sequences. ⋮ Palindromes and Sturmian words ⋮ Sturmian morphisms and \(\alpha\)-words ⋮ Characterization of test-sets for overlap-free morphisms ⋮ Matrices of 3-iet preserving morphisms ⋮ Combinatorial properties of sequences defined by the billiard in the tesselation triangles ⋮ On the triplex substitution -- combinatorial properties ⋮ On a combinatorial property of Sturmian words ⋮ Generalized Sturmian languages ⋮ A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid ⋮ Unnamed Item ⋮ Periodic words connected with the Fibonacci words ⋮ Morphisms fixing words associated with exchange of three intervals ⋮ Directive words of episturmian words: equivalences and normalization ⋮ Some algorithms to compute the conjugates of Episturmian morphisms ⋮ The structure of invertible substitutions on a three-letter alphabet ⋮ Well-balanced sequences ⋮ On invertible substitutions with two fixed points ⋮ Combinatorial, ergodic and arithmetic properties of the Tribonacci substitution ⋮ Sturmian morphisms and Rauzy's rules ⋮ Invertible substitutions on a three-letter alphabet.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sur les facteurs des suites de Sturm. (On the factors of the Sturmian sequences.)
- Sequences generated by infinitely iterated morphisms
- A generalization of automatic sequences
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- WHICH DISTRIBUTIONS OF MATTER DIFFRACT ? AN INITIAL INVESTIGATION
- Suites algébriques, automates et substitutions
- On the equivalence problem for binary DOL systems
This page was built for publication: Fibonacci morphisms and Sturmian words
