On the exact complexity of string matching: lower bounds
SIAM Journal on Computing
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
Alphabet-Independent Two-Dimensional Witness Computation
SIAM Journal on Computing
Regularity and finiteness conditions
Handbook of formal languages, vol. 1
Two-Dimensional Periodicity in Rectangular Arrays
SIAM Journal on Computing
Complexity of Toeplitz sequences.
Discrete Mathematics
Combinatorics of patterns of a bidimensional Sturmian sequence.
Theoretical Computer Science
Double sequences with complexity mn+11
Automatica (Journal of IFAC)
The complexity of functions on lattices
Theoretical Computer Science
The rectangle complexity of functions on two-dimensional lattices
Theoretical Computer Science
Digital Picture Processing
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
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
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)
On Fine and Wilf's theorem for bidimensional words
Theoretical Computer Science
Periodicity and local complexity
Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
A multidimensional critical factorization theorem
Theoretical Computer Science - In memoriam: Alberto Del Lungo (1965-2003)
Maximal pattern complexity of two-dimensional words
Theoretical Computer Science
Discrete Applied Mathematics
On periodicity of two-dimensional words
Theoretical Computer Science
On Periodicity of Generalized Two-Dimensional Words
Language and Automata Theory and Applications
On periodicity of generalized two-dimensional infinite words
Information and Computation
Optimal discovery of repetitions in 2D
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Plane digitization and related combinatorial problems
Discrete Applied Mathematics - Special issue: Advances in discrete geometry and topology (DGCI 2003)
Multidimensional extension of the Morse-Hedlund theorem
European Journal of Combinatorics
| Hi-index | 5.23 |
We prove that, given a double sequence w over the alphabet A (i.e. a mapping from Z2 to A), if there exists a pair (n0, m0) ∈ Z2 such that pw(n0, m0) n0m0, then w has a periodicity vector, where pw is the complexity function in rectangles of w.