Infinite binary words containing repetitions of odd period

Golnaz Badkobeh*, Maxime Crochemore

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)

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 languageEnglish
Pages (from-to)543-547
Number of pages5
JournalINFORMATION PROCESSING LETTERS
Volume115
Issue number5
Early online date22 Jan 2015
DOIs
Publication statusPublished - 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.

Cite this