Palindrome complexity bounds for primitive substitution sequences
From MaRDI portal
Publication:1579570
DOI10.1016/S0012-365X(00)00054-6zbMath0962.68141OpenAlexW2082059674MaRDI QIDQ1579570
Publication date: 13 June 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00054-6
Combinatorics on words (68R15) Formal languages and automata (68Q45) Selfadjoint operator theory in quantum theory, including spectral analysis (81Q10) Ergodic theory (37Axx) Low-dimensional dynamical systems (37Exx)
Related Items (12)
Abelian-square-rich words ⋮ Words with the Maximum Number of Abelian Squares ⋮ Factor versus palindromic complexity of uniformly recurrent infinite words ⋮ Languages invariant under more symmetries: overlapping factors versus palindromic richness ⋮ Spectra of Schreier graphs of Grigorchuk's group and Schroedinger operators with aperiodic order ⋮ On \(k\)-abelian palindromes ⋮ About the number of \(C^\infty \)-words of form \(\widetilde wxw \) ⋮ The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) ⋮ Total palindrome complexity of finite words ⋮ Palindrome complexity. ⋮ Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes ⋮ On a question of Hof, Knill and Simon on palindromic substitutive systems
This page was built for publication: Palindrome complexity bounds for primitive substitution sequences
