AbstractWe give a very short proof of a result by Fraenkel and Simpson (J. Combin. Theory, Ser. A 82 (1998) 112) which states that the number of distinct squares in a word of length n is at most 2n
Abstract. A square is the concatenation of a nonempty word with itself. A word has period p if its l...
Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed th...
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at ...
AbstractWe give a very short proof of a result by Fraenkel and Simpson (J. Combin. Theory, Ser. A 82...
AbstractAll our words (strings) are over afixedalphabet. A square is a subword of the formuu=u2, whe...
A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of ...
A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of ...
. All our words (strings) are over a fixed alphabet. A square is a subword of the form uu = u 2 ,...
Counting the types of squares rather than their occurrences, we consider the problem of bounding the...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
AbstractSquares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ a...
Article dans revue scientifique avec comité de lecture. internationale.International audienceEvery b...
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) ...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
AbstractA frame is a square uu, where u is an unbordered word. Let F(n) denote the maximum number of...
Abstract. A square is the concatenation of a nonempty word with itself. A word has period p if its l...
Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed th...
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at ...
AbstractWe give a very short proof of a result by Fraenkel and Simpson (J. Combin. Theory, Ser. A 82...
AbstractAll our words (strings) are over afixedalphabet. A square is a subword of the formuu=u2, whe...
A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of ...
A well known result of Fraenkel and Simpson states that the number of distinct squares in a word of ...
. All our words (strings) are over a fixed alphabet. A square is a subword of the form uu = u 2 ,...
Counting the types of squares rather than their occurrences, we consider the problem of bounding the...
International audienceA square is the concatenation of a nonempty word with itself. A word has perio...
AbstractSquares are strings of the form ww where w is any nonempty string. Two squares ww and w′w′ a...
Article dans revue scientifique avec comité de lecture. internationale.International audienceEvery b...
We consider the number σ(w) of positions that do not start a square in binary words w. Letting σ(n) ...
There are circular square-free words of length n on three symbols for n≥18. This proves a conjecture...
AbstractA frame is a square uu, where u is an unbordered word. Let F(n) denote the maximum number of...
Abstract. A square is the concatenation of a nonempty word with itself. A word has period p if its l...
Every binary word with at least four letters contains a square. A. Fraenkel and J. Simpson showed th...
A square is the concatenation of a nonempty word with itself. A word has period p if its letters at ...
DOI
Add to ORKG