Pages that link to "Item:Q2833546"
From MaRDI portal
The following pages link to Abelian complexity and frequencies of letters in infinite words (Q2833546):
Displaying 14 items.
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Relations on words (Q505060) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- A note on symmetries in the Rauzy graph and factor frequencies (Q1029352) (← links)
- Abelian complexity and abelian co-decomposition (Q1935803) (← links)
- On abelian saturated infinite words (Q2326392) (← links)
- Uniformly balanced words with linear complexity and prescribed letter frequencies (Q2789512) (← links)
- Abelian complexity of minimal subshifts (Q3074533) (← links)
- Ultimately constant abelian complexity of infinite words (Q3589628) (← links)
- On infinite HD0L words having sparse letters (Q4464260) (← links)
- On Abelian and Additive Complexity in Infinite Words (Q4650104) (← links)
- Abelian maximal pattern complexity of words (Q5175078) (← links)
- Dejean's conjecture and letter frequency (Q5899396) (← links)
- On infinite prefix normal words (Q5919082) (← links)