The periodic domino problem revisited

DOI10.1016/j.tcs.2010.08.017zbMath1234.03029OpenAlexW2082726263MaRDI QIDQ410732

Emmanuel Jeandel

Publication date: 3 April 2012

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.08.017

zbMATH Keywords

undecidabilitytilingsperiodic domino problem

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Combinatorial aspects of tessellation and tiling problems (05B45)

Cites Work

• Unnamed Item
• Unnamed Item
• An aperiodic set of 13 Wang tiles
• A small aperiodic set of Wang tiles
• Aperiodic tiles
• On the presence of periodic configurations in Turing machines and in counter machines.
• Undecidability and nonperiodicity for tilings of the plane
• Remarks on Berger's paper on the domino problem
• Two-by-Two Substitution Systems and the Undecidability of the Domino Problem
• Fixed Point and Aperiodic Tilings
• Periodicity in Tilings
• Periodicity and Immortality in Reversible Computing
• The Tiling Problem Revisited (Extended Abstract)
• Linear sampling and the ∀∃∀ case of the decision problem
• Notes on a class of tiling problems
• The undecidability of the Turing machine immortality problem
• The undecidability of the domino problem
• The classical decision problem.

This page was built for publication: The periodic domino problem revisited