 |
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 2 |
| Detailed view |  Export this paper |
 |
| Available versions: | v1 (2008-01-15) | v2 (2008-03-03) |
|
|
|
|
| Two-by-two Substitution Systems and the Undecidability of the Domino Problem |
|
|
| Nicolas Ollinger 1 |
|
|
| (2008-01-14) |
|
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'informatique Fondamentale de Marseille (LIF) |
|
|
|
CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Discrete Mathematics |
|
|
| aperiodic tile sets – formal languages – tilings – undecidability |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00204625, version 2 | |
| http://hal.archives-ouvertes.fr/hal-00204625 | |
| oai:hal.archives-ouvertes.fr:hal-00204625 | |
| From: Nicolas Ollinger | |
| Submitted on: Monday, 3 March 2008 12:07:18 | |
| Updated on: Monday, 3 March 2008 13:17:00 | |
