Pages that link to "Item:Q3637248"
From MaRDI portal
The following pages link to Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248):
Displaying 14 items.
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Generating square-free words efficiently (Q496050) (← links)
- Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Branching frequency and Markov entropy of repetition-free languages (Q832956) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Nonrepetitively 3-colorable subdivisions of graphs with a logarithmic number of subdivisions per edge (Q2665958) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- Transition Property for $$\alpha $$-Power Free Languages with $$\alpha \ge 2$$ and $$k\ge 3$$ Letters (Q5041268) (← links)
- Avoiding squares over words with lists of size three amongst four symbols (Q5097384) (← links)
- Transition property for cube-free words (Q5918354) (← links)
- Ann wins the nonrepetitive game over four letters and the erase-repetition game over six letters (Q6201902) (← links)
