Note: The periodic domino problem revisited

Authors:
Emmanuel Jeandel
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2010

Citing 9
Cited 0

Tilings and patterns

Tilings and patterns
Aperiodic tiles

Discrete & Computational Geometry
An aperiodic set of 13 Wang tiles

Discrete Mathematics
A small aperiodic set of Wang tiles

Discrete Mathematics
On the presence of periodic configurations in Turing machines and in counter machines

Theoretical Computer Science
Two-by-Two Substitution Systems and the Undecidability of the Domino Problem

CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Periodicity and Immortality in Reversible Computing

MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
The tiling problem revisited

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Periodicity in tilings

DLT'10 Proceedings of the 14th international conference on Developments in language theory

Quantified Score

Hi-index	5.23

Visualization

Abstract

In this article, we give a new proof of the undecidability of the periodic domino problem. Compared to previous proofs, the main difference is that this one does not start from a proof of the undecidability of the (general) domino problem but only from the existence of an aperiodic tileset.