Pages that link to "Item:Q465700"
From MaRDI portal
The following pages link to Growth properties of power-free languages (Q465700):
Displaying 15 items.
- Generating square-free words efficiently (Q496050) (← links)
- Palindromic rich words and run-length encodings (Q738876) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Bayes posterior convergence for loss functions via almost additive thermodynamic formalism (Q2116497) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Counting ternary square-free words quickly (Q2140467) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- On a generalization of Thue sequences (Q2346472) (← links)
- On shuffled-square-free words (Q2680851) (← links)
- Growth and ergodicity of context-free languages (Q3151247) (← links)
- On the Tree of Ternary Square-Free Words (Q3449372) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS (Q5247167) (← links)
- Critical exponent of binary words with few distinct palindromes (Q6574368) (← links)
