A connection between palindromic and factor complexity using return words
From MaRDI portal
Publication:2377963
DOI10.1016/j.aam.2008.03.005zbMath1160.68027arXiv0802.1332OpenAlexW2098464356MaRDI QIDQ2377963
Alessandro De Luca, Amy Glen, Luca Q. Zamboni, Michelangelo Bucci
Publication date: 20 January 2009
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.1332
Related Items (31)
Weighted prefix normal words: mind the gap ⋮ On Morphisms Preserving Palindromic Richness ⋮ Episturmian words: a survey ⋮ On the least number of palindromes contained in an infinite word ⋮ Languages invariant under more symmetries: overlapping factors versus palindromic richness ⋮ Palindromic richness for languages invariant under more symmetries ⋮ A characterization of subshifts with bounded powers ⋮ Extensions of rich words ⋮ Complexity and palindromic defect of infinite words ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ On theta-palindromic richness ⋮ Perfect balance and circularly rich words ⋮ On generalized highly potential words ⋮ Palindromic complexity of codings of rotations ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Rich, Sturmian, and trapezoidal words ⋮ On the zero defect conjecture ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ Generalized Thue-Morse words and palindromic richness ⋮ A new characteristic property of rich words ⋮ Burrows-Wheeler transform and palindromic richness ⋮ On Brlek-Reutenauer conjecture ⋮ Infinite words with finite defect ⋮ Palindromic richness ⋮ Rich and Periodic-Like Words ⋮ Balanced Words Having Simple Burrows-Wheeler Transform ⋮ Palindromes in infinite ternary words ⋮ Upper bound for palindromic and factor complexity of rich words ⋮ Rich square-free words
Cites Work
- Unnamed Item
- Unnamed Item
- On the number of factors of Sturmian words
- Palindromic prefixes and episturmian words
- Palindromic richness
- Descendants of primitive substitutions
- A characterization of substitutive sequences using return words
- A generalization of Cobham's theorem
- Episturmian words and episturmian morphisms
- Palindrome complexity.
- Pure discrete spectrum dynamical system and periodic tiling associated with a substitution
- Palindromes and Sturmian words
- Palindromic complexity of infinite words associated with simple Parry numbers
- Factor versus palindromic complexity of uniformly recurrent infinite words
- Palindromic prefixes and Diophantine approximation
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- On some problems related to palindrome closure
- Substitutional dynamical systems, Bratteli diagrams and dimension groups
- Représentation géométrique de suites de complexité $2n+1$
- Substitution dynamical systems : algebraic characterization of eigenvalues
- Episturmian words: a survey
- COMBINATORIAL PROPERTIES OF STURMIAN PALINDROMES
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: A connection between palindromic and factor complexity using return words
