On the least number of palindromes contained in an infinite word
From MaRDI portal
Publication:385043
DOI10.1016/j.tcs.2013.02.013zbMath1291.68307arXiv1301.3376OpenAlexW2068953207MaRDI QIDQ385043
Luca Q. Zamboni, Gabriele Fici
Publication date: 29 November 2013
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.3376
Related Items
On the aperiodic avoidability of binary patterns with variables and reversals, Reciprocal Sum of Palindromes, Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability, Properties of a class of Toeplitz words, Enumeration of two dimensional palindromes, A subquadratic algorithm for minimum palindromic factorization, HV-Palindromes in Two-Dimensional Words, Finite and infinite closed-rich words, Rich words in the block reversal of a word, On \(k\)-abelian palindromes, Unnamed Item, Longest arithmetic progressions of palindromes, On the least number of palindromes in two-dimensional words, On closed-rich words, Say no to case analysis: automating the drudgery of case-based proofs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rich, Sturmian, and trapezoidal words
- Transcendence measures for continued fractions involving repetitive or symmetric patterns
- Palindromic richness
- Sturmian words: structure, combinatorics, and their arithmetics
- Approximation to real numbers by cubic algebraic integers. II.
- Exponents of Diophantine approximation and Sturmian continued fractions.
- Palindrome complexity.
- Singular continuous spectrum for palindromic Schrödinger operators
- Palindromes and Sturmian words
- A new characteristic property of rich words
- Palindromic complexity of infinite words associated with simple Parry numbers
- Reversals and palindromes in continued fractions
- Factor versus palindromic complexity of uniformly recurrent infinite words
- A connection between palindromic and factor complexity using return words
- Palindromic prefixes and Diophantine approximation
- Palindromic continued fractions
- Mirror substitutions and palindromic sequences
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Schrödinger operators with Rudin-Shapiro potentials are not palindromic
- Approximation to real numbers by cubic algebraic integers I
- ON THE LITTLEWOOD CONJECTURE IN SIMULTANEOUS DIOPHANTINE APPROXIMATION
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- Episturmian words and some constructions of de Luca and Rauzy
