On the tree of ternary square-free words
From MaRDI portal
Publication:3449372
DOI10.1007/978-3-319-23660-5_19zbMATH Open1330.68241OpenAlexW2273472658MaRDI QIDQ3449372FDOQ3449372
Authors: 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
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- On ternary square-free circular words
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots
- Deciding context equivalence of binary overlap-free words in linear time
- Growth properties of power-free languages
- Aperiodic words on three symbols. II.
- Title not available (Why is that?)
- On the structure and extendibility of \(k\)-power free words
- The fixing block method in combinatorics on words
- Title not available (Why is that?)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect
- Constructing premaximal ternary square-free words of any level
- Constructing premaximal binary cube-free words of any level
Cited In (8)
- Finding the leftmost critical factorization on unordered alphabet
- Title not available (Why is that?)
- Transition property for cube-free words
- Square-free partial words with many wildcards
- Palindrome positions in ternary square-free words
- On the tree of binary cube-free words
- Constructing premaximal ternary square-free words of any level
- Ternary square-free partial words with many wildcards
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)
