Periodicity and local complexity
From MaRDI portal
Publication:596054
DOI10.1016/j.tcs.2004.02.026zbMath1068.68117OpenAlexW2157206415MaRDI QIDQ596054
Luca Q. Zamboni, Anthony N. Quas
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.026
Related Items (23)
Digital planarity -- a review ⋮ An Algebraic Geometric Approach to Multidimensional Words ⋮ Extensions of rich words ⋮ On periodic decompositions, one-sided nonexpansive directions and Nivat's conjecture ⋮ Nivat's conjecture and pattern complexity in algebraic subshifts ⋮ Complexity of short rectangles and periodicity ⋮ Minimal Complexities for Infinite Words Written with d Letters ⋮ A jump to the Narayana number for hereditary properties of ordered 3-uniform hypergraphs ⋮ The automorphism group of a shift of slow growth is amenable ⋮ An alphabetical approach to Nivat’s conjecture ⋮ On Periodicity of Generalized Two-Dimensional Words ⋮ Automaticity and Invariant Measures of Linear Cellular Automata ⋮ On automorphism groups of Toeplitz subshifts ⋮ On periodicity of two-dimensional words ⋮ The automorphism group of a shift of subquadratic growth ⋮ On automorphism groups of low complexity subshifts ⋮ An algebraic geometric approach to Nivat's conjecture ⋮ MULTIDIMENSIONAL STURMIAN SEQUENCES AND GENERALIZED SUBSTITUTIONS ⋮ On periodicity of generalized two-dimensional infinite words ⋮ Aperiodic two-dimensional words of small abelian complexity ⋮ Interplay between finite topological rank minimal Cantor systems, 𝒮-adic subshifts and their complexity ⋮ A multidimensional critical factorization theorem ⋮ Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
Cites Work
- Unnamed Item
- Unnamed Item
- The complexity of functions on lattices
- Tilings and rotations on the torus: A two-dimensional generalization of Sturmian sequences
- On a conjecture on bidimensional words.
- Sequence entropy and the maximal pattern complexity of infinite words
- The rectangle complexity of functions on two-dimensional lattices
This page was built for publication: Periodicity and local complexity
