The following pages link to Palindromes and Sturmian words (Q1960407):
Displaying 45 items.
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Introducing privileged words: privileged complexity of Sturmian words (Q388457) (← links)
- Generalized trapezoidal words (Q490909) (← links)
- On the zero defect conjecture (Q518184) (← links)
- On theta-palindromic richness (Q631773) (← links)
- Counter-intuitive answers to some questions concerning minimal-palindromic extensions of binary words (Q765352) (← links)
- Occurrences of palindromes in characteristic Sturmian words (Q818112) (← links)
- Combinatorial properties of smooth infinite words (Q818144) (← links)
- Relation between powers of factors and the recurrence function characterizing Sturmian words (Q837150) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- Factors of characteristic words: location and decompositions (Q982654) (← links)
- Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\) (Q997566) (← links)
- Palindromic richness (Q1003605) (← links)
- The complexity of \(C^{b\omega }\)-words of the form \(\tilde w xw\) (Q1034610) (← links)
- Searching for gapped palindromes (Q1038475) (← links)
- On graphs of central episturmian words (Q1041223) (← links)
- The index of Sturmian sequences (Q1348765) (← links)
- A note on differentiable palindromes. (Q1401323) (← links)
- Episturmian words and episturmian morphisms (Q1605314) (← links)
- Reversing and extended symmetries of shift spaces (Q1678225) (← links)
- Palindrome complexity. (Q1853729) (← links)
- Local symmetries in the period-doubling sequence (Q1962024) (← links)
- Longest arithmetic progressions of palindromes (Q1998905) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- Efficient computation of longest single-arm-gapped palindromes in a string (Q2297859) (← links)
- Arnoux-Rauzy substitutions and Palindrome words (Q2317957) (← links)
- Local symmetry dynamics in one-dimensional aperiodic lattices: a numerical study (Q2346793) (← links)
- Studies on finite Sturmian words (Q2354408) (← 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 geometrical characterization of factors of multidimensional billiard words and some applications (Q2373753) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Palindromic decompositions with gaps and errors (Q2399364) (← links)
- Characterizations of finite and infinite episturmian words via lexicographic orderings (Q2462316) (← links)
- About the number of \(C^\infty \)-words of form \(\widetilde wxw \) (Q2481971) (← links)
- Palindromic factors of billiard words (Q2484443) (← links)
- Inequalities characterizing standard Sturmian and episturmian words (Q2566013) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Computing Longest Single-arm-gapped Palindromes in a String (Q2971149) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS (Q3021999) (← links)
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function (Q3386617) (← links)
- Episturmian words: a survey (Q5321774) (← links)
- Episturmian words and some constructions of de Luca and Rauzy (Q5941085) (← links)
- Characterizations of families of morphisms and words via binomial complexities (Q6201915) (← links)
