Generalizations of the Periodicity Theorem of Fine and Wilf

We provide three generalizations to the two-dimensional case of the well known periodicity theorem by Fine and Wilf [4] for strings (the one-dimensional case). The first and the second generalizations can be further extended to hold in the more general setting of Cayley graphs of groups. Weak forms of two of our results have been developed for the design of efficient algorithms for two-dimensional pattern matching [2, 3, 6].

[1]  Alfred V. Aho,et al.  Algorithms for Finding Patterns in Strings , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[2]  H. Wilf,et al.  Uniqueness theorems for periodic functions , 1965 .

[3]  Azriel Rosenfeld,et al.  Digital Picture Processing , 1976 .

[4]  Gary Benson,et al.  Two-dimensional periodicity and its applications , 1992, SODA '92.

[5]  Mireille Régnier,et al.  A Unifying Look at d-Dimensional Periodicities and Space Coverings , 1993, CPM.

[6]  Raffaele Giancarlo,et al.  On the Exact Complexity of String Matching: Lower Bounds , 1991, SIAM J. Comput..

[7]  Zvi Galil,et al.  Truly alphabet-independent two-dimensional pattern matching , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  M. Schützenberger,et al.  The equation $a^M=b^Nc^P$ in a free group. , 1962 .

[9]  R. Lyndon,et al.  Combinatorial Group Theory , 1977 .