On the number of frames in binary words
From MaRDI portal
Publication:719267
DOI10.1016/J.TCS.2011.05.032zbMath1225.68141OpenAlexW2077313596MaRDI QIDQ719267
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.05.032
Related Items (3)
Decision algorithms for Fibonacci-automatic Words, I: Basic results ⋮ A Note on Squares in Binary Words ⋮ A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Avoiding large squares in infinite binary words
- Border correlation of binary words
- Periodicity and unbordered segments of words
- The Morse sequence and iterated morphisms
- An optimal algorithm for computing the repetitions in a word
- Relationship between the period of a finite word and the length of its unbordered segments
- How many squares can a string contain?
- Unbordered factors of the characteristic sequences of irrational numbers
- The exact number of squares in Fibonacci words
- How many squares must a binary sequence contain?
- Biinfinite words with maximal recurrent unbordered factors.
- Enumeration of factors in the Thue-Morse word
- How many square occurrences must a binary sequence contain?
- 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
- Least Periods of Factors of Infinite Words
- On the construction of maximal prefix-synchronized codes
- Rotations of Periodic Strings and Short Superstrings
- Density of Critical Factorizations
This page was built for publication: On the number of frames in binary words
