Cyclically repetition-free words on small alphabets
From MaRDI portal
(Redirected from Publication:765486)
Recommendations
Cites work
- scientific article; zbMATH DE number 5605093 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- Avoidable patterns in strings of symbols
- Avoiding large squares in infinite binary words
- 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
Cited in
(11)- 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
- Circularly squarefree words and unbordered conjugates: a new approach
- Smooth words on 2-letter alphabets having same parity
- Cyclic Permutations of Letters of Words in Languages over an Alphabet
- On ternary square-free circular words
- A length bound for binary equality words
- Repetition-free words
- Palindrome positions in ternary square-free words
- Cubefree words with many squares
- scientific article; zbMATH DE number 1943964 (Why is no real title available?)
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)
