Pages that link to "Item:Q1346736"
From MaRDI portal
The following pages link to How many squares must a binary sequence contain? (Q1346736):
Displayed 13 items.
- Spiraling and folding: the word view (Q548656) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- On the number of frames in binary words (Q719267) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- How many squares can a string contain? (Q1268630) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- A generalization of repetition threshold (Q2575754) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- Simple and flexible detection of contiguous repeats using a suffix tree (Q5958334) (← links)
