Palindromic richness
From MaRDI portal
Publication:1003605
DOI10.1016/j.ejc.2008.04.006zbMath1169.68040arXiv0801.1656OpenAlexW2913518517WikidataQ97016349 ScholiaQ97016349MaRDI QIDQ1003605
Luca Q. Zamboni, Amy Glen, Jacques Justin, Steven Widmer
Publication date: 4 March 2009
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0801.1656
Related Items (75)
Specular sets ⋮ The sequence of open and closed prefixes of a Sturmian word ⋮ Specular Sets ⋮ A connection between palindromic and factor complexity using return words ⋮ Palindromic factorization of rich words ⋮ Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences ⋮ On Morphisms Preserving Palindromic Richness ⋮ Episturmian words: a survey ⋮ A unique extension of rich words ⋮ EERTREE: an efficient data structure for processing palindromes in strings ⋮ On the least number of palindromes contained in an infinite word ⋮ Introducing privileged words: privileged complexity of Sturmian words ⋮ Languages invariant under more symmetries: overlapping factors versus palindromic richness ⋮ Palindrome pattern matching ⋮ Palindromic richness for languages invariant under more symmetries ⋮ Enumeration of two dimensional palindromes ⋮ A characterization of subshifts with bounded powers ⋮ On palindromic factorization of words ⋮ Words with many palindrome pair factors ⋮ Tight bound for the number of distinct palindromes in a tree ⋮ Extensions of rich words ⋮ A counterexample to a question of Hof, Knill and Simon ⋮ Counting distinct palindromes in a word in linear time ⋮ The history of the Gothenburg--Reykjavík--Strathclyde combinatorics group ⋮ Abelian combinatorics on words: a survey ⋮ Open and closed factors in Arnoux-Rauzy words ⋮ HV-Palindromes in Two-Dimensional Words ⋮ Finite and infinite closed-rich words ⋮ Rich words in the block reversal of a word ⋮ Morphisms generating antipalindromic words ⋮ On theta-palindromic richness ⋮ Computing Longest Single-arm-gapped Palindromes in a String ⋮ Algorithms and combinatorial properties on shortest unique palindromic substrings ⋮ Perfect balance and circularly rich words ⋮ On highly potential words ⋮ On generalized highly potential words ⋮ Palindromic complexity of codings of rotations ⋮ Palindromic closures using multiple antimorphisms ⋮ Ostrowski-automatic sequences: theory and applications ⋮ On generating binary words palindromically ⋮ Sturmian jungle (or garden?) on multiliteral alphabets ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Generalized trapezoidal words ⋮ Palindromic trees for a sliding window and its applications ⋮ Counting Palindromes in Substrings ⋮ ALMOST RICH WORDS AS MORPHIC IMAGES OF RICH WORDS ⋮ Morphic images of episturmian words having finite palindromic defect ⋮ Palindrome Pattern Matching ⋮ Rich, Sturmian, and trapezoidal words ⋮ On the zero defect conjecture ⋮ On \(k\)-abelian palindromes ⋮ Balancing and clustering of words in the Burrows-Wheeler transform ⋮ Special factors and the combinatorics of suffix and factor automata ⋮ 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 ⋮ A characterization of Sturmian sequences by indistinguishable asymptotic pairs ⋮ The repetition threshold for binary rich words ⋮ Palindromic rich words and run-length encodings ⋮ Efficient computation of longest single-arm-gapped palindromes in a string ⋮ A metric characterisation of repulsive tilings ⋮ Rich and Periodic-Like Words ⋮ Balanced Words Having Simple Burrows-Wheeler Transform ⋮ Improved estimates for the number of privileged words ⋮ On highly palindromic words: the ternary case ⋮ On abelian saturated infinite words ⋮ Codings of rotations on two intervals are full ⋮ Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study ⋮ Upper bound for palindromic and factor complexity of rich words ⋮ Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes ⋮ On a question of Hof, Knill and Simon on palindromic substitutive systems ⋮ On closed-rich words ⋮ Rich square-free words
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Substitutions in dynamics, arithmetics and combinatorics
- Palindromic prefixes and episturmian words
- Substitution dynamical systems - spectral analysis
- Complexity and special factors
- Descendants of primitive substitutions
- Sturmian words: structure, combinatorics, and their arithmetics
- Episturmian words and episturmian morphisms
- Balanced words
- Palindrome complexity.
- Singular continuous spectrum for palindromic Schrödinger operators
- Palindromes and Sturmian words
- Palindromic complexity of infinite words associated with simple Parry numbers
- A characterization of balanced episturmian sequences
- Factor versus palindromic complexity of uniformly recurrent infinite words
- A connection between palindromic and factor complexity using return words
- Palindromic prefixes and Diophantine approximation
- Mirror substitutions and palindromic sequences
- Complementing and exactly covering sequences
- Return words in Sturmian and episturmian words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Sturmian and Episturmian Words
- COMBINATORIAL PROPERTIES OF ARNOUX–RAUZY SUBSHIFTS AND APPLICATIONS TO SCHRÖDINGER OPERATORS
- Episturmian words: a survey
- Sequences with minimal block growth
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: Palindromic richness