Domino problem for pretty low complexity subshifts
From MaRDI portal
Publication:2086736
DOI10.1007/978-3-030-92551-2_19OpenAlexW4226454974MaRDI QIDQ2086736
Publication date: 25 October 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92551-2_19
Uses Software
Cites Work
- Low-complexity tilings of the plane
- An algebraic geometric approach to Nivat's conjecture
- Undecidability and nonperiodicity for tilings of the plane
- Cellular Automata and Groups
- An aperiodic set of 11 Wang tiles
- Nonexpansive $\mathbb {Z}^2$-subdynamics and Nivat’s Conjecture
- The undecidability of the domino problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Domino problem for pretty low complexity subshifts