Combinatorial substitutions and sofic tilings
Combinatorics
2011-03-10 v2 Discrete Mathematics
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, Goodman-Strauss'98) in a much shorter presentation.
Keywords
Cite
@article{arxiv.1009.5167,
title = {Combinatorial substitutions and sofic tilings},
author = {Thomas Fernique and Nicolas Ollinger},
journal= {arXiv preprint arXiv:1009.5167},
year = {2011}
}
Comments
17 pages, 16 figures. In proceedings of JAC 2010