The following pages link to Palindromic richness (Q1003605):
Displaying 50 items.
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Introducing privileged words: privileged complexity of Sturmian words (Q388457) (← links)
- Languages invariant under more symmetries: overlapping factors versus palindromic richness (Q389460) (← links)
- Palindrome pattern matching (Q390901) (← links)
- Palindromic richness for languages invariant under more symmetries (Q391781) (← links)
- A characterization of subshifts with bounded powers (Q394287) (← links)
- On palindromic factorization of words (Q394756) (← links)
- Extensions of rich words (Q401472) (← links)
- A counterexample to a question of Hof, Knill and Simon (Q405294) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- On generating binary words palindromically (Q472173) (← links)
- Generalized trapezoidal words (Q490909) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- On the zero defect conjecture (Q518184) (← links)
- Balancing and clustering of words in the Burrows-Wheeler transform (Q544888) (← links)
- Special factors and the combinatorics of suffix and factor automata (Q551186) (← links)
- On theta-palindromic richness (Q631773) (← links)
- Palindromic complexity of codings of rotations (Q650872) (← links)
- On Brlek-Reutenauer conjecture (Q719304) (← links)
- Infinite words with finite defect (Q719337) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- A metric characterisation of repulsive tilings (Q745672) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- EERTREE: an efficient data structure for processing palindromes in strings (Q1678105) (← links)
- Algorithms and combinatorial properties on shortest unique palindromic substrings (Q1711666) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- A characterization of Sturmian sequences by indistinguishable asymptotic pairs (Q2033924) (← links)
- On closed-rich words (Q2117106) (← links)
- Palindromic factorization of rich words (Q2143052) (← links)
- Morphisms generating antipalindromic words (Q2198987) (← links)
- On generalized highly potential words (Q2215978) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- On highly palindromic words: the \(n\)-ary case (Q2231750) (← links)
- Palindromic trees for a sliding window and its applications (Q2234804) (← links)
- A new characteristic property of rich words (Q2271424) (← links)
- Burrows-Wheeler transform and palindromic richness (Q2271441) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study (Q2346793) (← links)
- Privileged factors in the Thue-Morse word -- a comparison of privileged words and palindromes (Q2354723) (← links)
- Rich square-free words (Q2357378) (← links)
- Specular sets (Q2358694) (← links)
- The sequence of open and closed prefixes of a Sturmian word (Q2363308) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- On highly potential words (Q2444733) (← links)
- Palindromic closures using multiple antimorphisms (Q2446105) (← links)