Constructing premaximal ternary square-free words of any level
From MaRDI portal
Publication:2912773
DOI10.1007/978-3-642-32589-2_65zbMATH Open1365.68364OpenAlexW2280268851MaRDI QIDQ2912773FDOQ2912773
Authors: Elena A. Petrova, Arseny M. Shur 
Publication date: 25 September 2012
Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-32589-2_65
Recommendations
Cited In (11)
- Power-free complementary binary morphisms
- Lengths of extremal square-free ternary words
- Subword complexity and power avoidance
- Title not available (Why is that?)
- Transition property for cube-free words
- On the tree of ternary square-free words
- Square-free partial words with many wildcards
- Extremal square-free words
- Constructing premaximal binary cube-free words of any level
- Constructing premaximal binary cube-free words of any level
- Ternary square-free partial words with many wildcards
This page was built for publication: Constructing premaximal ternary square-free words of any level
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2912773)
