Pages that link to "Item:Q2372771"
From MaRDI portal
The following pages link to Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771):
Displayed 21 items.
- On the least number of palindromes contained in an infinite word (Q385043) (← links)
- Extensions of rich words (Q401472) (← links)
- On theta-palindromic richness (Q631773) (← links)
- Rich, Sturmian, and trapezoidal words (Q955036) (← links)
- Palindromic richness (Q1003605) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Longest arithmetic progressions of palindromes (Q1998905) (← links)
- Some properties of the \(k\)-bonacci words on infinite alphabet (Q2200435) (← links)
- A new characteristic property of rich words (Q2271424) (← links)
- Pattern avoidance by palindromes (Q2271438) (← links)
- Rich square-free words (Q2357378) (← links)
- Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- Symmetrized \(\beta \)-integers (Q2474235) (← links)
- Codings of rotations on two intervals are full (Q2851477) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Study of irreducible balanced pairs for substitutive languages (Q3537490) (← links)
- Rich and Periodic-Like Words (Q3637220) (← links)
- Reciprocal Sum of Palindromes (Q5212143) (← links)
- Episturmian words: a survey (Q5321774) (← links)
- Combinatorial and arithmetical properties of infinite words associated with non-simple quadratic Parry numbers (Q5425751) (← links)