The following pages link to Repetition-free words (Q1078338):
Displaying 21 items.
- Growth properties of power-free languages (Q465700) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- On the complexity of deciding avoidability of sets of partial words (Q606993) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- The entropy of square-free words (Q967942) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- Overlap-free morphisms and finite test-sets (Q1887045) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- RATIONAL APPROXIMATIONS OF POLYNOMIAL FACTORIAL LANGUAGES (Q3444851) (← links)
- Comparing Complexity Functions of a Language and Its Extendable Part (Q3526422) (← links)
- Polynomial languages with finite antidictionaries (Q3625693) (← links)
- On the Complexity of Deciding Avoidability of Sets of Partial Words (Q3637218) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- Interview with Jeffrey Shallit (Q6098018) (← links)
- A note on the base-\(p\) expansions of putative counterexamples to the \(p\)-adic Littlewood conjecture (Q6536728) (← links)
- Power-free complementary binary morphisms (Q6565999) (← links)
- The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)
