Pages that link to "Item:Q612919"
From MaRDI portal
The following pages link to On ternary square-free circular words (Q612919):
Displaying 19 items.
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- Cyclically repetition-free words on small alphabets (Q765486) (← links)
- On periodic properties of circular words (Q897316) (← links)
- On balanced and abelian properties of circular words over a ternary alphabet (Q2098185) (← links)
- Counting ternary square-free words quickly (Q2140467) (← links)
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 (Q2216428) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Ternary Square-Free Partial Words with Many Wildcards (Q2817387) (← links)
- On the existence of minimal \(\beta\)-powers (Q2909104) (← links)
- On the Tree of Ternary Square-Free Words (Q3449372) (← links)
- (Q4434201) (← links)
- Square-Free Partial Words with Many Wildcards (Q4683234) (← links)
- Lengths of extremal square-free ternary words. (Q4986268) (← links)
- Distinct Squares in Circular Words (Q5150916) (← links)
- Square-free extensions of words (Q5154718) (← links)
- Minimal forbidden factors of circular words (Q5915743) (← links)
- Counting subwords in circular words and their Parikh matrices (Q6185846) (← links)