Splicing semigroups of dominoes and DNA
Discrete Mathematics
Handbook of formal languages, vol. 1
Language theory and molecular genetics: generative mechanisms suggested by DNA recombination
Handbook of formal languages, vol. 2
On the combinatorics of finite words
Theoretical Computer Science
Partial words and a theorem of Fine and Wilf
Theoretical Computer Science
Theoretical Computer Science
Local periods and binary partial words: an algorithm
Theoretical Computer Science
Partial words and the critical factorization theorem
Journal of Combinatorial Theory Series A
Codes, orderings, and partial words
Theoretical Computer Science
Generalised fine and Wilf's theorem for arbitrary number of periods
Theoretical Computer Science - Combinatorics on words
Discrete Applied Mathematics
Testing primitivity on partial words
Discrete Applied Mathematics
Partial words and the critical factorization theorem revisited
Theoretical Computer Science
Theoretical Computer Science
Theoretical Computer Science
Graph connectivity, partial words, and a theorem of Fine and Wilf
Information and Computation
Periodicity properties on partial words
Information and Computation
New Perspectives on the Prefix Array
SPIRE '08 Proceedings of the 15th International Symposium on String Processing and Information Retrieval
A new approach to the periodicity lemma on strings with holes
Theoretical Computer Science
Discrete Applied Mathematics
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Combinatorial queries and updates on partial words
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Combinatorics on partial word correlations
Journal of Combinatorial Theory Series A
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
Indeterminate string inference algorithms
Journal of Discrete Algorithms
DNA'04 Proceedings of the 10th international conference on DNA computing
| Hi-index | 5.23 |
A 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,...,n1} 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 biolog