Pages that link to "Item:Q1579570"
From MaRDI portal
The following pages link to Palindrome complexity bounds for primitive substitution sequences (Q1579570):
Displaying 18 items.
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- Languages invariant under more symmetries: overlapping factors versus palindromic richness (Q389460) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) (Q1034610) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- Asymptotic orbits of primitive substitutions (Q1400000) (← links)
- Spectra of Schreier graphs of Grigorchuk's group and Schroedinger operators with aperiodic order (Q1709778) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Local symmetries in the period-doubling sequence (Q1962024) (← links)
- Criterion for substitutivity of Sturmian palindromes and one-dimensional factor dynamics (Q2027884) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Abelian-square-rich words (Q2358695) (← links)
- Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751) (← links)
- Mirror substitutions and palindromic sequences (Q2465631) (← links)
- About the number of \(C^\infty \)-words of form \(\widetilde wxw \) (Q2481971) (← links)
- Words with the Maximum Number of Abelian Squares (Q3449363) (← links)
- Efficient Computation of Palindromes in Sequences with Uncertainties* (Q4611213) (← links)
