AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particular, we give a characterization of recurrent, periodic and eventually periodic infinite words in terms of local periods
One of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Peri...
AbstractWe study the relationship between the global periodicity of a word and its (local) repetitio...
The Critical Factorization Theorem is one of the principal results in combinatorics on words. It rel...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
AbstractWe call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough...
Motivated by the extension of the critical factorization theorem to infinite words, we study the (lo...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
The concept of periodicity has played over the years a centra1 role in the development of combinator...
AbstractOne of the most beautiful and useful notions in the Mathematical Theory of Strings is that o...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractPartial words are finite sequences over a finite alphabet that may contain some holes. A var...
AbstractIn this paper, we consider one of the most fundamental results on the periodicity of words, ...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
One of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Peri...
AbstractWe study the relationship between the global periodicity of a word and its (local) repetitio...
The Critical Factorization Theorem is one of the principal results in combinatorics on words. It rel...
AbstractWe study recurrence and periodicity in infinite words by using local conditions. In particul...
AbstractWe prove a periodicity theorem on words that has strong analogies with the Critical Factoriz...
AbstractWe call a one-way infinite word w over a finite alphabet (ρ,l)-repetitive if all long enough...
Motivated by the extension of the critical factorization theorem to infinite words, we study the (lo...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
The concept of periodicity has played over the years a centra1 role in the development of combinator...
AbstractOne of the most beautiful and useful notions in the Mathematical Theory of Strings is that o...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractPartial words are finite sequences over a finite alphabet that may contain some holes. A var...
AbstractIn this paper, we consider one of the most fundamental results on the periodicity of words, ...
AbstractIn this paper, we study word regularities and in particular extensions of the notion of the ...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
One of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Peri...
AbstractWe study the relationship between the global periodicity of a word and its (local) repetitio...
The Critical Factorization Theorem is one of the principal results in combinatorics on words. It rel...
DOI
Add to ORKG