Mirror substitutions and palindromic sequences
From MaRDI portal
Publication:2465631
DOI10.1016/J.TCS.2007.08.003zbMath1143.68063OpenAlexW2085511118MaRDI QIDQ2465631
Publication date: 7 January 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2007.08.003
Related Items (14)
Symmetric and congruent Rauzy fractals ⋮ Interval Exchange Words and the Question of Hof, Knill, and Simon ⋮ Reversing and extended symmetries of shift spaces ⋮ On the least number of palindromes contained in an infinite word ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ A counterexample to a question of Hof, Knill and Simon ⋮ Morphisms generating antipalindromic words ⋮ Palindromic sequences generated from marked morphisms ⋮ On the conjugacy class of the Fibonacci dynamical system ⋮ On the zero defect conjecture ⋮ Exchange of three intervals: substitutions and palindromicity ⋮ Infinite words with finite defect ⋮ Palindromic richness ⋮ On a question of Hof, Knill and Simon on palindromic substitutive systems
Cites Work
- Unnamed Item
- Unnamed Item
- Complexity of sequences and dynamical systems
- On the complexity of infinite sequences
- On the subword equivalence problem for morphic words
- Invertible substitutions and Sturmian sequences.
- Palindrome complexity.
- Singular continuous spectrum for palindromic Schrödinger operators
- Sequence entropy and the maximal pattern complexity of infinite words
This page was built for publication: Mirror substitutions and palindromic sequences
