 |
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-00521215, version 1 |
| arXiv: 1009.5167 |
| Detailed view |  Export this paper |
 |
|
|
| Combinatorial substitutions and sofic tilings |
|
|
Thomas Fernique 1Nicolas Ollinger 1 |
|
|
| (2010-09-26) |
|
|
|
| A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local constraints. This extends some similar previous results (Mozes'90, Goodmann-Strauss'98) in a much shorter presentation. |
|
|
|
|
|
|
|
|
|
|
|
| 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/Other |
|
|
| substiutions – tilings – soficity |
|
|
|
| Attached file list to this document: | ||||||||||
|
||||||||||
|
|
|
| hal-00521215, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00521215 | |
| oai:hal.archives-ouvertes.fr:hal-00521215 | |
| From: Nicolas Ollinger | |
| Submitted on: Sunday, 26 September 2010 19:37:32 | |
| Updated on: Monday, 27 September 2010 08:23:33 | |
