AbstractWe call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough prefixes of w contain as a suffix a ρth power (or more generally a repetition of order ρ) of a word of length at most l. We show that each (2,4)-repetitive word is ultimately periodic, as well as that there exist continuum many, and hence also nonultimately periodic, (2,5)-repetitive words. Further, we characterize nonultimately periodic (2,5)-repetitive words both structurally and algebraically
AbstractThe concept of periodicity has played over the years a central role in the development of co...
Given a string x = x[1..n], a repetition of period p in x is a substring ur = x[i..i+rp−1], p = |u|,...
AbstractWe give a criterion, using oriented graphs, to decide whether an infinite word generated as ...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
AbstractLocal constraints on an infinite sequence that imply global regularity are of general intere...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
AbstractAnswering an open problem in papers by Marcus and Pǎun (1994), we give here two examples of ...
International audienceIn combinatorics of words, a concatenation of k consecutive equal blocks is ca...
Motivated by the extension of the critical factorization theorem to infinite words, we study the (lo...
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order ...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
Given a string x = x[1..n], a repetition of period p in x is a substring ur = x[i..i+rp−1], p = |u|,...
AbstractWe give a criterion, using oriented graphs, to decide whether an infinite word generated as ...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
AbstractLocal constraints on an infinite sequence that imply global regularity are of general intere...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
AbstractAnswering an open problem in papers by Marcus and Pǎun (1994), we give here two examples of ...
International audienceIn combinatorics of words, a concatenation of k consecutive equal blocks is ca...
Motivated by the extension of the critical factorization theorem to infinite words, we study the (lo...
In combinatorics of words, a concatenation of k consecutive equal blocks is called a power of order ...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
The following result is established: Let L be a DOL language and x1, x2,…, a sequence of all words i...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractIn this paper, we provide a new characterization of uniformly recurrent words with finite de...
AbstractIn this note we prove two cancellation properties of iterated morphisms and use these proper...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
Given a string x = x[1..n], a repetition of period p in x is a substring ur = x[i..i+rp−1], p = |u|,...
AbstractWe give a criterion, using oriented graphs, to decide whether an infinite word generated as ...