AbstractA word of length n over a finite alphabet A is a map from {0,…,n−1} into A. A partial word of length n over A is a partial map from {0,…,n−1} into A. In the latter case, elements of {0,…,n−1} without image are called holes (a word is just a partial word without holes). In this paper, we extend a fundamental periodicity result on words due to Fine and Wilf to partial words with two or three holes. This study was initiated by Berstel and Boasson for partial words with one hole. Partial words are motivated by molecular biology
AbstractPartial words are sequences over a finite alphabet that may contain some undefined positions...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractA word of length n over a finite alphabet A is a map from {0,…,n−1} into A. A partial word o...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractA partial word is a word that is a partial mapping into an alphabet. We prove a variant of F...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractPartial words, or sequences over a finite alphabet that may have do-not-know symbols or hole...
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, ha...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
AbstractThe problem of computing periods in words, or finite sequences of symbols from a finite alph...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
Partial words are finite sequences over a finite alphabet that may contain some holes. A variant o...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
AbstractPartial words are sequences over a finite alphabet that may contain some undefined positions...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...
AbstractA word of length n over a finite alphabet A is a map from {0,…,n−1} into A. A partial word o...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet, also...
AbstractA partial word of length n over a finite alphabet A is a partial map from {0,…, n − 1} into ...
AbstractA partial word is a word that is a partial mapping into an alphabet. We prove a variant of F...
AbstractThe study of the combinatorial properties of strings of symbols from a finite alphabet (also...
AbstractPartial words, or sequences over a finite alphabet that may have do-not-know symbols or hole...
The problem of computing periods in words, or finite sequences of symbols from a finite alphabet, ha...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
AbstractThe problem of computing periods in words, or finite sequences of symbols from a finite alph...
AbstractThe concept of periodicity has played over the years a central role in the development of co...
Partial words are finite sequences over a finite alphabet that may contain some holes. A variant o...
AbstractPartial words are sequences over a finite alphabet that may contain wildcard symbols, called...
AbstractPartial words are sequences over a finite alphabet that may contain some undefined positions...
AbstractThe study of combinatorics on words, or finite sequences of symbols from a finite alphabet, ...
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, ...