Suppose ƒ : X* → X* is a morphism and u,v ∈ X*. For every nonnegative integer n, let zn be the longest common prefix of ƒn(u) and ƒn(v), and let un,vn ∈ X* be words such that ƒn(u) = znun and ƒn(v) = znvn. We prove that there is a positive integer q such that for any positive integer p, the prefixes of un (resp. vn) of length p form an ultimately periodic sequence having period q. Further, there is a value of q which works for all words u,v ∈ X*
Given a string $\s{x}=\s{x}[1..n]$, a repetition of period p in {\mbox{\boldmath x}} is a substring ...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
Given a string x = x[1..n], a repetition of period p in x is a substring u(r) = x[i..i+rp-1], p = ve...
Suppose ƒ : X* → X* is a morphism and u,v ∈ X*. For every nonnegative integer n, let zn be the longe...
In 1965, Fine and Wilf proved the following theorem: if (fn)n¿0 and (gn)n¿0 are periodic sequences o...
AbstractIn 1965, Fine and Wilf proved the following theorem: if (fn)n⩾0 and (gn)n⩾0 are periodic seq...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
peer reviewedGiven a morphism h prolongable on a and an integer p, we present an algorithm that calc...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractWe consider so-called Toeplitz words which can be viewed as generalizations of one-way infin...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
We write x≺yx≺y when x and y are vectors with each element of x less than or equal to the correspond...
Given a string x = x[1..n], a repetition of period p in x is a substring u r = x[i..i + rp − 1], p ...
Definition 1. Let x be a word of length jxj = n having integer periods p and q. Throughout we put d ...
Given a string $\s{x}=\s{x}[1..n]$, a repetition of period p in {\mbox{\boldmath x}} is a substring ...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
Given a string x = x[1..n], a repetition of period p in x is a substring u(r) = x[i..i+rp-1], p = ve...
Suppose ƒ : X* → X* is a morphism and u,v ∈ X*. For every nonnegative integer n, let zn be the longe...
In 1965, Fine and Wilf proved the following theorem: if (fn)n¿0 and (gn)n¿0 are periodic sequences o...
AbstractIn 1965, Fine and Wilf proved the following theorem: if (fn)n⩾0 and (gn)n⩾0 are periodic seq...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
peer reviewedGiven a morphism h prolongable on a and an integer p, we present an algorithm that calc...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractWe consider so-called Toeplitz words which can be viewed as generalizations of one-way infin...
AbstractThe well-known Periodicity Lemma of Fine and Wilf states that if the word x of length n has ...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
We write x≺yx≺y when x and y are vectors with each element of x less than or equal to the correspond...
Given a string x = x[1..n], a repetition of period p in x is a substring u r = x[i..i + rp − 1], p ...
Definition 1. Let x be a word of length jxj = n having integer periods p and q. Throughout we put d ...
Given a string $\s{x}=\s{x}[1..n]$, a repetition of period p in {\mbox{\boldmath x}} is a substring ...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
Given a string x = x[1..n], a repetition of period p in x is a substring u(r) = x[i..i+rp-1], p = ve...
DOI
Add to ORKG