On the Tree of Ternary Square-Free Words

DOI10.1007/978-3-319-23660-5_19zbMath1330.68241OpenAlexW2273472658MaRDI QIDQ3449372

Elena A. Petrova, Arseny M. Shur

Publication date: 4 November 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23660-5_19

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (4)

Finding the leftmost critical factorization on unordered alphabet ⋮ Square-Free Partial Words with Many Wildcards ⋮ Transition property for cube-free words ⋮ Ternary Square-Free Partial Words with Many Wildcards

Cites Work

• Unnamed Item
• Unnamed Item
• Deciding context equivalence of binary overlap-free words in linear time
• Growth properties of power-free languages
• On ternary square-free circular words
• A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
• Avoidable patterns in strings of symbols
• The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
• On the structure and extendibility of \(k\)-power free words
• The fixing block method in combinatorics on words
• CONSTRUCTING PREMAXIMAL BINARY CUBE-FREE WORDS OF ANY LEVEL
• Constructing Premaximal Ternary Square-Free Words of Any Level
• Aperiodic words on three symbols. II.

This page was built for publication: On the Tree of Ternary Square-Free Words