Skip to main content
Conference Proceedings

Two-by-two substitution systems and the undecidability of the domino problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5028 LNCS 476-485
DOI: 10.1007/978-3-540-69407-6_51
20Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Thanks to a careful study of elementary properties of two-by-two substitution systems, we give a complete self-contained elementary construction of an aperiodic tile set and sketch how to use this tile set to elementary prove the undecidability of the classical Domino Problem. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Ollinger, N. (2008). Two-by-two substitution systems and the undecidability of the domino problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5028 LNCS, pp. 476–485). https://doi.org/10.1007/978-3-540-69407-6_51

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free