On generating binary words palindromically
From MaRDI portal
Publication:472173
DOI10.1016/j.jcta.2014.10.003zbMath1307.68060arXiv1309.1886OpenAlexW2133240281MaRDI QIDQ472173
Mari Huova, Luca Q. Zamboni, Tero J.Harju
Publication date: 19 November 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.1886
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lyndon words and Fibonacci numbers
- Periodicity and unbordered segments of words
- Palindromic richness
- Sequences with constant number of return words
- Some combinatorial properties of Sturmian words
- Sturmian words: structure, combinatorics, and their arithmetics
- Sturmian words, Lyndon words and trees
- Singular continuous spectrum for palindromic Schrödinger operators
- A palindromization map for the free group
- Codes of central Sturmian words
- On the complexity of algebraic numbers. II: Continued fractions
- Return words in Sturmian and episturmian words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- MINIMAL DUVAL EXTENSIONS
- Sturmian and Episturmian Words
- PALINDROMES AND ORDERINGS IN ARTIN GROUPS
- Palindromes dans les progressions arithmétiques
- Sequence entropy and the maximal pattern complexity of infinite words
- BALANCED WORDS AND MAJORIZATION
- Eigenvalues and simplicity of interval exchange transformations
- Uniqueness Theorems for Periodic Functions
- Abelian returns in Sturmian words
- A characterization of Sturmian words by return words
- Watson-Crick palindromes in DNA computing
