Alphabet independent two dimensional matching
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Two-dimensional periodicity and its applications
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Two-dimensional dictionary matching
Information Processing Letters
An Alphabet Independent Approach to Two-Dimensional Pattern Matching
SIAM Journal on Computing
Two-Dimensional Periodicity in Rectangular Arrays
SIAM Journal on Computing
Digital Picture Processing
A Unifying Look at d-Dimensional Periodicities and Space Coverings
CPM '93 Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching
Generalizations of the Periodicity Theorem of Fine and Wilf
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
On a conjecture on bidimensional words
Theoretical Computer Science
On a conjecture on bidimensional words
Theoretical Computer Science
Generalised fine and Wilf's theorem for arbitrary number of periods
Theoretical Computer Science - Combinatorics on words
Theoretical Computer Science - The art of theory
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
On a Special Class of Primitive Words
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On a special class of primitive words
Theoretical Computer Science
An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
Fundamenta Informaticae
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
| Hi-index | 5.24 |
Generalizations of Fine and Wilf's Periodicity Theorem are obtained for the case of bidimensional words using geometric arguments. The domains considered constitute a large class of convex subsets of R2 which include most parallelograms. A complete discussion is provided for the parallelogram case.