 |
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
 |
|
Laboratoire d'informatique fondamentale de Marseille UMR 6166 - CNRS, Université de la Méditerranée, Université de Provence |
|
| HAL: hal-00204625, version 1 |
| Short view |  Export this paper |
 |
| Two-by-two Substitution Systems and the Undecidability of the Domino Problem Ollinger N. http://hal.archives-ouvertes.fr/hal-00204625 |
|
|
| Available versions: | v1 (2008-01-15) | v2 (2008-03-03) |
|
|
|
|
| Publication type: | |
Preprint, Working Paper, ... | ||||||||||||||||||
|
||||||||||||||||||||
| Subject: | |
Computer Science/Discrete Mathematics | ||||||||||||||||||
|
||||||||||||||||||||
| Title: | |
Two-by-two Substitution Systems and the Undecidability of the Domino Problem | ||||||||||||||||||
|
||||||||||||||||||||
| Author(s): | |
Nicolas Ollinger 1 |
||||||||||||||||||
|
||||||||||||||||||||
| Laboratory: | |
|
||||||||||||||||||
|
||||||||||||||||||||
| 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. | ||||||||||||||||||
|
||||||||||||||||||||
| Fulltext language: | |
English | ||||||||||||||||||
|
||||||||||||||||||||
| Production date: | |
2008-01-14 | ||||||||||||||||||
|
||||||||||||||||||||
| Keyword(s): | |
aperiodic tile sets – formal languages – tilings – undecidability | ||||||||||||||||||
|
||||||||||||||||||||
| Comment: | |
10+6 pages | ||||||||||||||||||
|
||||||||||||||||||||
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00204625, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00204625 | |
| oai:hal.archives-ouvertes.fr:hal-00204625 | |
| From: Nicolas Ollinger | |
| Submitted on: Tuesday, 15 January 2008 11:05:46 | |
| Updated on: Tuesday, 15 January 2008 11:39:07 | |
