Pages that link to "Item:Q2373751"
From MaRDI portal
The following pages link to Factor versus palindromic complexity of uniformly recurrent infinite words (Q2373751):
Displaying 24 items.
- 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)
- Palindromic richness for languages invariant under more symmetries (Q391781) (← links)
- Morphic images of episturmian words having finite palindromic defect (Q499487) (← links)
- Complexity and palindromic defect of infinite words (Q620969) (← links)
- On theta-palindromic richness (Q631773) (← links)
- On Brlek-Reutenauer conjecture (Q719304) (← links)
- Infinite words with finite defect (Q719337) (← links)
- Weighted prefix normal words: mind the gap (Q832931) (← links)
- Matrices of 3-iet preserving morphisms (Q930921) (← links)
- Palindromic richness (Q1003605) (← links)
- A note on symmetries in the Rauzy graph and factor frequencies (Q1029352) (← links)
- Pattern avoidance by palindromes (Q2271438) (← links)
- Specular sets (Q2358694) (← links)
- Palindromic complexity of infinite words associated with simple Parry numbers (Q2372771) (← links)
- A connection between palindromic and factor complexity using return words (Q2377963) (← links)
- On highly potential words (Q2444733) (← links)
- Palindromic closures using multiple antimorphisms (Q2446105) (← links)
- Sturmian jungle (or garden?) on multiliteral alphabets (Q2998727) (← links)
- Generalized Thue-Morse words and palindromic richness (Q3165663) (← links)
- Sturmian and Episturmian Words (Q3522857) (← links)
- Palindromes in infinite ternary words (Q3653092) (← links)
- Upper bound for palindromic and factor complexity of rich words (Q5021104) (← links)
