Combinatorial substitutions and sofic tilings

Thomas Fernique; Nicolas Ollinger

HAL: hal-00521215, version 1

arXiv: 1009.5167

Short view

Export this paper

Combinatorial substitutions and sofic tilings
Fernique T., Ollinger N.
http://hal.archives-ouvertes.fr/hal-00521215

Publication type:

Preprint, Working Paper, ...

Subject:

Computer Science/Other

Title:

Combinatorial substitutions and sofic tilings

Author(s):

Thomas Fernique (

) ¹, Nicolas Ollinger (

) ¹

Laboratory:

1:	Laboratoire d'informatique Fondamentale de Marseille (LIF)

	http://www.lif.univ-mrs.fr/

	CNRS : UMR6166 – Université de la Méditerranée - Aix-Marseille II – Université de Provence - Aix-Marseille I

	CMI 39, Rue Joliot Curie 13453 MARSEILLE CEDEX 13

	France

Abstract:

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.

Fulltext language:

English

Production date:

2010-09-26

Keyword(s):

substiutions – tilings – soficity

ANR Project:

Project Id

ANR-09-BLAN-0164, EMC

Attached file list to this document:

TEX

(379.5 KB)

(39.9 KB)

(19.3 KB)

(120.1 KB)

(27.4 KB)

(28.5 KB)

(43.5 KB)

(8 KB)

(44.7 KB)

(8.5 KB)

(46.3 KB)

(9.1 KB)

(96.4 KB)

(36 KB)

(15.1 KB)

(52.1 KB)

(21.6 KB)

PDF

combisubst.pdf

(257 KB)

combisubst.ps

(1 MB)


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