Domino problem for pretty low complexity subshifts

DOI10.1007/978-3-030-92551-2_19MaRDI QIDQ2086736zbMATH OpenOpenAlexFDO

Authors Jarkko Kari

Publication date 25 October 2022

Full work available at URL https://doi.org/10.1007/978-3-030-92551-2_19

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• An aperiodic set of 11 Wang tiles
• Cellular automata and groups
• scientific article; zbMATH DE number 45557 (Why is no real title available?)
• scientific article; zbMATH DE number 7650899 (Why is no real title available?)
• Low-complexity tilings of the plane
• Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
• Subword complexity and periodicity in two or more dimensions
• The undecidability of the domino problem
• Undecidability and nonperiodicity for tilings of the plane

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: Domino problem for pretty low complexity subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086736)