Substitutions and Strongly Deterministic Tilesets - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

Substitutions and Strongly Deterministic Tilesets


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.
Fichier principal
Vignette du fichier
104ways.pdf (1010.25 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-00661887 , version 1 (20-01-2012)



Bastien Le Gloannec, Nicolas Ollinger. Substitutions and Strongly Deterministic Tilesets. Computability in Europe (CiE), Jun 2012, Cambridge, United Kingdom. pp 462-471, ⟨10.1007/978-3-642-30870-3_47⟩. ⟨hal-00661887⟩
139 View
282 Download



Gmail Mastodon Facebook X LinkedIn More