Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
From MaRDI portal
Publication:765352
DOI10.1016/J.DAM.2011.09.011zbMATH Open1235.68119OpenAlexW1999958832MaRDI QIDQ765352FDOQ765352
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
Cites Work
- Title not available (Why is that?)
- Sturmian words: structure, combinatorics, and their arithmetics
- Singular continuous spectrum for palindromic Schrödinger operators
- Automatic Sequences
- A note on palindromicity
- On highly palindromic words
- Palindromes and Sturmian words
- Watson-Crick palindromes in DNA computing
- Title not available (Why is that?)
- Regions and Standard Modes
- Title not available (Why is that?)
- On a Class of Locally Symmetric Sequences: The Right Infinite Word Λ θ
- A palindromic half-line criterion for absence of eigenvalues and applications to substitution Hamiltonians
Cited In (6)
- On highly palindromic words: the \(n\)-ary case
- On highly palindromic words: the ternary case
- On a theorem concerning partially overlapping subpalindromes of a binary word
- On the palindromic decomposition of binary words
- A new measure of asymmetry of binary words
- On binary palindromes of the form \(10^n\pm 1\)
Recommendations
This page was built for publication: Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765352)
