Abstract
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].
On leave from Dipartimento di Matematica ed Applicazioni, Universitá di Palermo, Italia
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Aho A. V.: Algorithms for Finding Pattern in Strings. In Handbook of Theoretical Computer Science, J. van Leeuwen editor, Elsevier Science Publishers B.V. 1990, 257–295
Amir, A., Benson, G. E.: Two-Dimensional Periodicity and its Applications. Proc. 3rd ACM-SIAM Symp. on Discr. Algorithms (1992) 440–452
Amir, A., Benson, G. E.: Alphabet Independent Two-Dimensional Pattern Matching. Proc. 24th ACM Symp. Theory on Comp. (1992) 59–68
Fine, N. J., Wilf, H. S.: Uniqueness Theorem for Periodic Functions. Proc. Am. Math. Soc. 16 (1965) 109–114
Galil, Z., Giancarlo, R.: On the Exact Complexity of String Matching: Upper Bounds. SIAM J. Comp. 20 number 6 1008–1020
Galil, Z., Park, K.: Truly Alphabet Independent Two-Dimensional Pattern Matching Proc. 33th IEEE Symp. on Foundations of Computer Science (1992) 247–256
Galil, Z., Park, K.: Truly Alphabet Independent Two-Dimensional Pattern Matching preprint (1993)
Lyndon, R.C., Schupp, P.E.: Combinatorial Group Theory, Springer Verlag 1977
Lothaire: Combinatorics on Words. Encyclopedia of Mathemathics and its Applications, 17 Addison-Wesley 1983
Lyndon, R. C., Schutzemberger, M. P.: The Equation a m=b n c p in a Free Group. Michigan Math. J. 9 number 4 (1962) 289–298
Nicodeme, P., Regnier, M.: Towards 2D Pattern Matching Complexity, manuscript (1992)
Rosenfeld, A., Kak, A.C.: Digital Picture Processing. Academic Press 1982
Regnier, M., Rostami, L.: A Unifying Look at d-Dimensional Periodicities and Space Coverings. Proc. 4th Symposium on Combinatorial Pattern Matching (1993) 215–227
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Giancarlo, R., Mignosi, F. (1994). Generalizations of the periodicity theorem of Fine and Wilf. In: Tison, S. (eds) Trees in Algebra and Programming — CAAP'94. CAAP 1994. Lecture Notes in Computer Science, vol 787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017478
Download citation
DOI: https://doi.org/10.1007/BFb0017478
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57879-6
Online ISBN: 978-3-540-48373-1
eBook Packages: Springer Book Archive