论文信息 - Combinatorial Substitutions and Sofic Tilings

Combinatorial Substitutions and Sofic Tilings

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.

Nicolas Ollinger | Thomas Fernique | Nicolas Ollinger | Thomas Fernique

[1] Robert L. Berger. The undecidability of the domino problem , 1966 .

[2] Thomas Fernique,et al. Brun expansions of stepped surfaces , 2011, Discret. Math..

[3] P. Arnoux,et al. Pisot substitutions and Rauzy fractals , 2001 .

[4] Thomas Fernique,et al. Local rule substitutions and stepped surfaces , 2007, Theor. Comput. Sci..

[5] Nicolas Ollinger. Two-by-Two Substitution Systems and the Undecidability of the Domino Problem , 2008, CiE.

[6] Natalie Priebe Frank,et al. Detecting Combinatorial Hierarchy in Tilings Using Derived Voronoi Tessellations , 2003, Discret. Comput. Geom..

[7] R. Robinson. Undecidability and nonperiodicity for tilings of the plane , 1971 .

[8] C. Goodman-Strauss. MATCHING RULES AND SUBSTITUTION TILINGS , 1998 .

[9] S. Mozes. Tilings, substitution systems and dynamical systems generated by them , 1989 .