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.68119OpenAlexW1999958832MaRDI 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
Related Items (3)
On highly palindromic words: the \(n\)-ary case ⋮ On a theorem concerning partially overlapping subpalindromes of a binary word ⋮ On highly palindromic words: the ternary case
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
This page was built for publication: Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
