The following pages link to Palindrome complexity. (Q1853729):
Displaying 50 items.
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- Symmetric and congruent Rauzy fractals (Q297991) (← links)
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Languages invariant under more symmetries: overlapping factors versus palindromic richness (Q389460) (← links)
- Palindrome pattern matching (Q390901) (← links)
- On palindromic factorization of words (Q394756) (← links)
- A counterexample to a question of Hof, Knill and Simon (Q405294) (← links)
- A subquadratic algorithm for minimum palindromic factorization (Q405573) (← links)
- Counting distinct palindromes in a word in linear time (Q407601) (← links)
- On factors of synchronized sequences (Q410714) (← links)
- Palindromic sequences generated from marked morphisms (Q499461) (← links)
- Equations on palindromes and circular words (Q544873) (← links)
- Complexity and palindromic defect of infinite words (Q620969) (← links)
- Infinite words with finite defect (Q719337) (← links)
- Palindromic prefixes and episturmian words (Q855827) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Palindromic richness (Q1003605) (← links)
- A note on symmetries in the Rauzy graph and factor frequencies (Q1029352) (← links)
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) (Q1034610) (← links)
- Uniform spectral properties of one-dimensional quasicrystals. IV. Quasi-Sturmian potentials (Q1034832) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- The ring of \(k\)-regular sequences. II. (Q1426034) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Derived sequences and the factor spectrum of the period-doubling sequence (Q2154584) (← links)
- Morphisms generating antipalindromic words (Q2198987) (← links)
- Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435) (← links)
- On prefix palindromic length of automatic words (Q2235743) (← links)
- A new characteristic property of rich words (Q2271424) (← links)
- Pattern avoidance by palindromes (Q2271438) (← links)
- Palindromic Ziv-Lempel and Crochemore factorizations of \(m\)-bonacci infinite words (Q2272382) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← 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)
- Some properties of the Tribonacci sequence (Q2372431) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Palindromic length of words and morphisms in class \(\mathcal{P}\) (Q2420618) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- Time-space trade-offs for longest common extensions (Q2442815) (← links)
- Mirror substitutions and palindromic sequences (Q2465631) (← links)
- Symmetrized \(\beta \)-integers (Q2474235) (← links)
- About the number of \(C^\infty \)-words of form \(\widetilde wxw \) (Q2481971) (← links)
- Language structure of pattern Sturmian words (Q2502894) (← links)
- Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Time-Space Trade-Offs for Longest Common Extensions (Q2904502) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
