DeepAI AI Chat
Log In Sign Up

A Note on Squares in Binary Words

by   Tero Harju, et al.
Turun yliopisto

We consider words over a binary alphabet. A word w is overlap-free if it does not have factors (blocks of consecutive letters) of the form uvuvu for nonempty u. Let M(w) denote the number of positions that are middle positions of squares in w. We show that for overlap-free binary words, 2M(w) ≤ |w|+3, and that there are infinitely many overlap-free binary words for which 2M(w)=|w|+3.


page 1

page 2

page 3

page 4


Extremal overlap-free and extremal β-free binary words

An overlap-free (or β-free) word w over a fixed alphabet Σ is extremal i...

Transduction of Automatic Sequences and Applications

We consider the implementation of the transduction of automatic sequence...

Decomposing predictability: Semantic feature overlap between words and the dynamics of reading for meaning

The present study uses a computational approach to examine the role of s...

The First-Order Theory of Binary Overlap-Free Words is Decidable

We show that the first-order logical theory of the binary overlap-free w...

The Simplest Binary Word with Only Three Squares

We re-examine previous constructions of infinite binary words containing...

Overlap Splines and Meshless Finite Difference Methods

We consider overlap splines that are defined by connecting the patches o...

An explicit algorithm for normal forms in small overlap monoids

If 𝒫 = ⟨ A | R ⟩ is a monoid presentation, then the relation words in...