Pages that link to "Item:Q2708947"
From MaRDI portal
The following pages link to Subword complexity and periodicity in two or more dimensions (Q2708947):
Displaying 17 items.
- Periodicity and local complexity (Q596054) (← links)
- Multidimensional extension of the Morse-Hedlund theorem (Q691591) (← links)
- Complexity of short rectangles and periodicity (Q896072) (← links)
- The complexity of functions on lattices (Q1583591) (← links)
- Domino problem for pretty low complexity subshifts (Q2086736) (← links)
- Aperiodic two-dimensional words of small abelian complexity (Q2327230) (← links)
- Nivat's conjecture and pattern complexity in algebraic subshifts (Q2422038) (← links)
- Coverability and multi-scale coverability on infinite pictures (Q2424689) (← links)
- Enumeration of two dimensional palindromes (Q2672656) (← links)
- Decidability and periodicity of low complexity tilings (Q2701070) (← links)
- Coverability in Two Dimensions (Q2799191) (← links)
- Subword complexity and Laurent series (Q2855524) (← links)
- The Maximal Subword Complexity of Quasiperiodic Infinite Words (Q4964023) (← links)
- An alphabetical approach to Nivat’s conjecture (Q5113441) (← links)
- Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture (Q5264929) (← links)
- Forbidden Substrings, Kolmogorov Complexity and Almost Periodic Sequences (Q5449816) (← links)
- On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture (Q6085424) (← links)