Sturmian numeration systems and decompositions to palindromes
From MaRDI portal
Publication:1750221
DOI10.1016/j.ejc.2018.04.003zbMath1402.68147arXiv1710.11553OpenAlexW2765112097MaRDI QIDQ1750221
Publication date: 18 May 2018
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1710.11553
Related Items (12)
Prefix palindromic length of the Thue-Morse word ⋮ Prefix palindromic length of the Sierpinski word ⋮ Palindromic length and reduction of powers ⋮ The palindromization map ⋮ The number of valid factorizations of Fibonacci prefixes ⋮ Palindromic length of words and morphisms in class \(\mathcal{P}\) ⋮ An Inequality for the Number of Periods in a Word ⋮ On highly palindromic words: the \(n\)-ary case ⋮ On prefix palindromic length of automatic words ⋮ Longest arithmetic progressions of palindromes ⋮ Unnamed Item ⋮ On highly palindromic words: the ternary case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On palindromic factorization of words
- Sturmian graphs and integer representations over numeration systems
- On the number of factors of Sturmian words
- Occurrences of palindromes in characteristic Sturmian words
- The index of Sturmian sequences
- Some combinatorial properties of Sturmian words
- Palindromic length in free monoids and free groups
- On the structure of bispecial Sturmian words
- An Exercise on Fibonacci Representations
- Automatic Sequences
- Greedy Palindromic Lengths
- Developments in Language Theory
- On the numeration system of Ostrowski
This page was built for publication: Sturmian numeration systems and decompositions to palindromes