Attainable lengths for circular binary words avoiding \(k\) powers
From MaRDI portal
Publication:2475529
zbMath1137.68046MaRDI QIDQ2475529
Publication date: 11 March 2008
Published in: Bulletin of the Belgian Mathematical Society - Simon Stevin (Search for Journal in Brave)
Related Items (4)
\((2+\epsilon )\)-nonrepetitive list colouring of paths ⋮ Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture ⋮ The Thue-Morse word contains circular \(5/2^+\) power free words of every length ⋮ The weak circular repetition threshold over large alphabets
This page was built for publication: Attainable lengths for circular binary words avoiding \(k\) powers
