Pages that link to "Item:Q1871376"
From MaRDI portal
The following pages link to How many square occurrences must a binary sequence contain? (Q1871376):
Displaying 12 items.
- The number of positions starting a square in binary words (Q625366) (← links)
- On the number of frames in binary words (Q719267) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- How many squares must a binary sequence contain? (Q1346736) (← links)
- On \(k\)-abelian palindromes (Q1753996) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- On the average number of regularities in a word (Q2437740) (← links)
- Squares in partial words (Q2440165) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- Constructing Words with High Distinct Square Densities (Q5016360) (← links)