Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
From MaRDI portal
Publication:765352
DOI10.1016/j.dam.2011.09.011zbMath1235.68119MaRDI QIDQ765352
Publication date: 19 March 2012
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2011.09.011
68R15: Combinatorics on words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On highly palindromic words
- Sturmian words: structure, combinatorics, and their arithmetics
- Singular continuous spectrum for palindromic Schrödinger operators
- Palindromes and Sturmian words
- A note on palindromicity
- Regions and Standard Modes
- On a Class of Locally Symmetric Sequences: The Right Infinite Word Λ θ
- Automatic Sequences
- A palindromic half-line criterion for absence of eigenvalues and applications to substitution Hamiltonians
- Watson-Crick palindromes in DNA computing