Constructing premaximal ternary square-free words of any level

DOI10.1007/978-3-642-32589-2_65MaRDI QIDQ2912773zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Recommendations

• Lengths of extremal square-free ternary words
• On the tree of ternary square-free words
• No extremal square-free words over large alphabets
• Extremal square-free words
• Squarefree extensions of words

Cited in

(11)

• Power-free complementary binary morphisms
• Lengths of extremal square-free ternary words
• Subword complexity and power avoidance
• scientific article; zbMATH DE number 2000848 (Why is no real title available?)
• 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)