Pages that link to "Item:Q2635089"
From MaRDI portal
The following pages link to Closed, palindromic, rich, privileged, trapezoidal, and balanced words in automatic sequences (Q2635089):
Displayed 10 items.
- Counting the number of non-zero coefficients in rows of generalized Pascal triangles (Q512556) (← links)
- On highly palindromic words: the ternary case (Q777417) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Upper bound for the number of privileged words (Q2092391) (← links)
- Ostrowski-automatic sequences: theory and applications (Q2222098) (← links)
- Upper bound for the number of closed and privileged words (Q2294441) (← links)
- Open and closed factors in Arnoux-Rauzy words (Q2423399) (← links)
- Upper bound for palindromic and factor complexity of rich words (Q5021104) (← links)
- On the automaticity of sequences defined by the Thue–Morse and period-doubling Stieltjes continued fractions (Q5140301) (← links)
- Rich words in the block reversal of a word (Q6157425) (← links)