Lengths of extremal square-free ternary words.
From MaRDI portal
Publication:4986268
DOI10.11575/cdm.v16i1.69831zbMath1467.68149arXiv2001.11763OpenAlexW3159934812MaRDI QIDQ4986268
Publication date: 27 April 2021
Full work available at URL: https://arxiv.org/abs/2001.11763
Related Items (6)
No extremal square-free words over large alphabets ⋮ Lengths of irreducible and delicate words ⋮ On shuffled-square-free words ⋮ The lengths for which bicrucial square-free permutations exist ⋮ Extensions and reductions of squarefree words ⋮ Square-free extensions of words
Cites Work
- Unnamed Item
- Unnamed Item
- Polynomial versus exponential growth in repetition-free binary words
- On ternary square-free circular words
- The origins of combinatorics on words
- Avoidable patterns in strings of symbols
- Uniformly growing k-th power-free homomorphisms
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- Disposability in square-free words
- Extremal square-free words
- Circularly squarefree words and unbordered conjugates: a new approach
- Repetitions in words
This page was built for publication: Lengths of extremal square-free ternary words.