Projects per year
Abstract
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at distance p match. The exponent of a nonempty word is its length divided by its smallest period. In this article, we give some new results on the trade-off between the number of squares and the number of cubes in infinite binary words whose square factors have odd periods.
Original language | English |
---|---|
Pages (from-to) | 543-547 |
Number of pages | 5 |
Journal | INFORMATION PROCESSING LETTERS |
Volume | 115 |
Issue number | 5 |
Early online date | 22 Jan 2015 |
DOIs | |
Publication status | Published - May 2015 |
Keywords
- Combinatorial problems
- Combinatorics on words
- Repetitions
- Repetitive threshold
- Word morphisms
Fingerprint
Dive into the research topics of 'Infinite binary words containing repetitions of odd period'. Together they form a unique fingerprint.Projects
- 1 Finished
-
Succinct and compressed data structures for string indexing and processing
16/03/2015 → 31/07/2017
Project: Research