Cyclically repetition-free words on small alphabets
From MaRDI portal
Publication:765486
DOI10.1016/J.IPL.2010.05.005zbMATH Open1234.68330OpenAlexW2156921874MaRDI QIDQ765486FDOQ765486
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
Recommendations
Cites Work
- Avoidable patterns in strings of symbols
- How many squares must a binary sequence contain?
- Title not available (Why is that?)
- There are ternary circular square-free words of length \(n\) for \(n \geq\) 18
- On nonrepetitive sequences
- Title not available (Why is that?)
- Avoiding large squares in infinite binary words
Cited In (7)
- On balanced and abelian properties of circular words over a ternary alphabet
- Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
- Smooth words on 2-letter alphabets having same parity
- Cyclic Permutations of Letters of Words in Languages over an Alphabet
- Repetition-free words
- Palindrome positions in ternary square-free words
- Title not available (Why is that?)
This page was built for publication: Cyclically repetition-free words on small alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765486)