The rectangle complexity of functions on two-dimensional lattices

Theoretical Computer Science

Volumn 270, Issue 1-2, 2002, Pages 857-863

  Sander, J W ^a   Tijdeman, R ^b  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

Complexity; Configurations; Lattices; Patterns; Periodicity

Indexed keywords

COMPUTATIONAL COMPLEXITY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; RECURSIVE FUNCTIONS; VECTORS;

INTEGER COEFFICIENTS; TWO-DIMENSIONAL LATTICES;

THEOREM PROVING;

EID: 0037028451     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00281-X     Document Type: Article

References (6)

1. Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
2. Symbolic dynamics
3. The complexity of functions on lattices
4. k
5. Combinatoire des motifs d'une suite sturmienne bidimensionelle