On the number of frames in binary words
From MaRDI portal
Recommendations
Cites work
- A note on the number of squares in a word
- A simple proof that a word of length \(n\) has at most \(2n\) distinct squares
- An optimal algorithm for computing the repetitions in a word
- Avoiding large squares in infinite binary words
- Biinfinite words with maximal recurrent unbordered factors.
- Border correlation of binary words
- Density of Critical Factorizations
- Enumeration of factors in the Thue-Morse word
- How many square occurrences must a binary sequence contain?
- How many squares can a string contain?
- How many squares must a binary sequence contain?
- scientific article; zbMATH DE number 5605093 (Why is no real title available?)
- scientific article; zbMATH DE number 3811868 (Why is no real title available?)
- scientific article; zbMATH DE number 1988973 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- Least Periods of Factors of Infinite Words
- On the construction of maximal prefix-synchronized codes
- Periodicity and unbordered segments of words
- Relationship between the period of a finite word and the length of its unbordered segments
- Rotations of Periodic Strings and Short Superstrings
- The exact number of squares in Fibonacci words
- The Morse sequence and iterated morphisms
- Unbordered factors of the characteristic sequences of irrational numbers
Cited in
(3)
This page was built for publication: On the number of frames in binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719267)