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 colorings as the set of tilings of finite tileset. We show that for 2×2 substitutions the resulting tileset can furthermore be chosen strongly deterministic, a tile being uniquely determined by any two adjacent edges. A tiling by a strongly deterministic tileset can be locally reconstructed starting from any infinite path that cross every line and column of the tiling.
['Bastien Le Gloannec', 'Nicolas Ollinger']
Substitutions and strongly deterministic tilesets