On Two Stronger Versions of Dejean’s Conjecture

DOI10.1007/978-3-642-32589-2_69zbMath1365.68365OpenAlexW44219933MaRDI QIDQ2912779

Arseny M. Shur, Igor N. Tunev

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_69

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items (7)

Avoiding or Limiting Regularities in Words ⋮ Growth properties of power-free languages ⋮ The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ ⋮ Transition property for cube-free words ⋮ Subword complexity and power avoidance ⋮ Abelian repetition threshold revisited ⋮ Asymptotic repetitive threshold of balanced sequences

This page was built for publication: On Two Stronger Versions of Dejean’s Conjecture