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]. |
Year | DOI | Venue |
---|---|---|
1994 | 10.1007/BFb0017478 | CAAP |
Keywords | Field | DocType |
periodicity theorem,pattern matching,cayley graph | Discrete mathematics,Combinatorics,Vertex-transitive graph,Generalization,Cayley graph,Pattern matching,Normal subgroup,Mathematics | Conference |
ISBN | Citations | PageRank |
3-540-57879-X | 10 | 0.80 |
References | Authors | |
6 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Raffaele Giancarlo | 1 | 1112 | 107.23 |
Filippo Mignosi | 2 | 569 | 99.71 |