Cyclically repetition-free words on small alphabets

DOI10.1016/j.ipl.2010.05.005zbMath1234.68330OpenAlexW2156921874MaRDI QIDQ765486

Dirk Nowotka, Tero J.Harju

Publication date: 19 March 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.05.005

zbMATH Keywords

combinatorial problemsrepetitionscombinatorics on wordssquare-free wordsconjugates

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Related Items

Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101

Cites Work

• Avoiding large squares in infinite binary words
• Avoidable patterns in strings of symbols
• How many squares must a binary sequence contain?
• On nonrepetitive sequences
• There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
• Unnamed Item
• Unnamed Item