Pages that link to "Item:Q3428618"
From MaRDI portal
The following pages link to Efficient lower bounds on the number of repetition-free words (Q3428618):
Displaying 12 items.
- Growth properties of power-free languages (Q465700) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- Counting ternary square-free words quickly (Q2140467) (← links)
- Reduced word enumeration, complexity, and randomization (Q2144333) (← links)
- Counting abelian squares efficiently for a problem in quantum computing (Q2699853) (← links)
- Improved bounds on the number of ternary square-free words (Q2776771) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- Binary words avoiding the pattern AABBCABBA (Q5190083) (← links)
- Efficient representation and counting of antipower factors in words (Q5919279) (← links)