Statements (15)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:appliesTo |
two-dimensional configurations
|
| gptkbp:describes |
relationship between two-dimensional words and periodicity
|
| gptkbp:field |
theoretical computer science
combinatorics on words |
| https://www.w3.org/2000/01/rdf-schema#label |
Nivat's theorem
|
| gptkbp:influenced |
gptkb:symbolic_dynamics
tiling theory theory of multidimensional words |
| gptkbp:namedAfter |
gptkb:Maurice_Nivat
|
| gptkbp:publicationYear |
1969
|
| gptkbp:publishedIn |
gptkb:Journal_of_Computer_and_System_Sciences
|
| gptkbp:state |
If a two-dimensional word has at most mn distinct m×n blocks, then it is periodic in at least one direction.
|
| gptkbp:bfsParent |
gptkb:Maurice_Nivat
|
| gptkbp:bfsLayer |
6
|