Pages that link to "Item:Q557912"
From MaRDI portal
The following pages link to Avoiding large squares in infinite binary words (Q557912):
Displaying 18 items.
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Square-free shuffles of words (Q496046) (← links)
- Avoiding large squares in partial words (Q551207) (← 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)
- Clusters of repetition roots: single chains (Q831839) (← links)
- A low-complexity LUT-based squaring algorithm (Q971658) (← links)
- A generalization of Thue freeness for partial words (Q1006051) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Hairpin structures defined by DNA trajectories (Q2272214) (← links)
- Efficient big integer multiplication and squaring algorithms for cryptographic applications (Q2336123) (← links)
- Infinite binary words containing repetitions of odd period (Q2339599) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- The simplest binary word with only three squares (Q5021107) (← links)
