On the tree of ternary square-free words
From MaRDI portal
Publication:3449372
Recommendations
Cites work
- scientific article; zbMATH DE number 3976386 (Why is no real title available?)
- scientific article; zbMATH DE number 3732062 (Why is no real title available?)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Aperiodic words on three symbols. II.
- Avoidable patterns in strings of symbols
- Constructing premaximal binary cube-free words of any level
- Constructing premaximal ternary square-free words of any level
- Deciding context equivalence of binary overlap-free words in linear time
- Growth properties of power-free languages
- On ternary square-free circular words
- On the structure and extendibility of \(k\)-power free words
- The fixing block method in combinatorics on words
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
Cited in
(8)- scientific article; zbMATH DE number 2000848 (Why is no real title available?)
- Palindrome positions in ternary square-free words
- Finding the leftmost critical factorization on unordered alphabet
- Ternary square-free partial words with many wildcards
- Square-free partial words with many wildcards
- Constructing premaximal ternary square-free words of any level
- On the tree of binary cube-free words
- Transition property for cube-free words
This page was built for publication: On the tree of ternary square-free words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3449372)