 |
|
|
|
| HAL: hal-00661887, version 1 |
| DOI: 10.1007/978-3-642-30870-3_47 |
| Detailed view |  Export this paper |
|
|
| Computability in Europe (CiE), Cambridge : Royaume-Uni (2012) |
|
|
|
|
| Substitutions and Strongly Deterministic Tilesets |
|
|
Bastien Le Gloannec 1Nicolas Ollinger 1 |
|
|
| (2012) |
|
|
|
| Substitutions generate hierarchical colorings of the plane. Despite the non-locality of substitution rules, one can extend them by adding compatible local matching rules to obtain locally checkable color- ings as the set of tilings of finite tileset. We show that the resulting tileset can furthermore be chosen strongly deterministic, a tile being uniquely determined by any two adjacent edges. A tiling by a strongly determin- istic tileset can be locally reconstructed starting from any infinite path that cross every line and column of the tiling. |
|
|
|
|
|
|
|
|
|
|
|
| 1: | Laboratoire d'Informatique Fondamentale d'Orléans (LIFO) |
|
|
|
Université d'Orléans : EA4022 – Ecole Nationale Supérieure d'Ingénieurs de Bourges |
|
|
|
|
|
|
|
|
|
| Subject | : | Computer Science/Other Computer Science/Formal Languages and Automata Theory |
|
|
| Subsitution – Tiling – Soficity – Wang tiles – Deterministic tiles |
|
|
|
| Attached file list to this document: | |||||
|
|||||
|
|
|
| hal-00661887, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00661887 | |
| oai:hal.archives-ouvertes.fr:hal-00661887 | |
| From: Nicolas Ollinger | |
| Submitted on: Friday, 20 January 2012 21:07:02 | |
| Updated on: Wednesday, 15 May 2013 18:08:55 | |
