Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words
From MaRDI portal
(Redirected from Publication:765352)
Recommendations
Cites work
- scientific article; zbMATH DE number 5898639 (Why is no real title available?)
- scientific article; zbMATH DE number 1494144 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- A note on palindromicity
- A palindromic half-line criterion for absence of eigenvalues and applications to substitution Hamiltonians
- Automatic Sequences
- On a class of locally symmetric sequences: the right infinite word \(\Lambda _{\theta }\)
- On highly palindromic words
- Palindromes and Sturmian words
- Regions and standard modes
- Singular continuous spectrum for palindromic Schrödinger operators
- Sturmian words: structure, combinatorics, and their arithmetics
- Watson-Crick palindromes in DNA computing
Cited in
(8)- On highly palindromic words: the \(n\)-ary case
- On highly palindromic words: the ternary case
- The optimal upper bound on the MP-ratio for quaternary words
- On a theorem concerning partially overlapping subpalindromes of a binary word
- And now there are four: another brick in the wall of the optimal upper bound on the MP-ratio
- On the palindromic decomposition of binary words
- On binary palindromes of the form \(10^n\pm 1\)
- A new measure of asymmetry of binary words
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)
