On ternary square-free circular words
From MaRDI portal
Publication:612919
zbMath1213.68480arXiv1009.5759MaRDI QIDQ612919
Publication date: 16 December 2010
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1009.5759
Related Items (14)
A ternary square-free sequence avoiding factors equivalent to \(abcacba\) ⋮ On the Tree of Ternary Square-Free Words ⋮ Counting ternary square-free words quickly ⋮ Avoiding letter patterns in ternary square-free words ⋮ Lengths of extremal square-free ternary words. ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ On periodic properties of circular words ⋮ Counting subwords in circular words and their Parikh matrices ⋮ Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101 ⋮ Distinct Squares in Circular Words ⋮ Square-Free Partial Words with Many Wildcards ⋮ Ternary Square-Free Partial Words with Many Wildcards ⋮ Square-free extensions of words ⋮ Subword complexity and power avoidance
This page was built for publication: On ternary square-free circular words
