Pages that link to "Item:Q3021999"
From MaRDI portal
The following pages link to ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS (Q3021999):
Displaying 50 items.
- On a question of Hof, Knill and Simon on palindromic substitutive systems (Q258070) (← links)
- Palindromic language of thin discrete planes (Q265052) (← links)
- Some permutations on Dyck words (Q287437) (← links)
- On the avoidability index of palindromes (Q351673) (← 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)
- Palindromic richness for languages invariant under more symmetries (Q391781) (← links)
- Palindromes in circular words (Q401312) (← 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)
- Palindromic sequences generated from marked morphisms (Q499461) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- On the zero defect conjecture (Q518184) (← links)
- Complexity and palindromic defect of infinite words (Q620969) (← 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)
- Palindromic prefixes and episturmian words (Q855827) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Palindromic richness (Q1003605) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- A note on differentiable palindromes. (Q1401323) (← links)
- Sturmian numeration systems and decompositions to palindromes (Q1750221) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Longest arithmetic progressions of palindromes (Q1998905) (← links)
- On closed-rich words (Q2117106) (← 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)
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study (Q2346793) (← links)
- A \(d\)-dimensional extension of Christoffel words (Q2354678) (← links)
- Rich square-free words (Q2357378) (← 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)
- Balancedness and coboundaries in symbolic systems (Q2422021) (← links)
- On highly potential words (Q2444733) (← links)
- Palindromic closures using multiple antimorphisms (Q2446105) (← links)
- Pseudopalindrome closure operators in free monoids (Q2508984) (← links)
- Codings of rotations on two intervals are full (Q2851477) (← links)
- Cyclic Complexity of Words (Q2922011) (← links)
