Résumé : A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. 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, GoodmanStrauss’98) in a shorter presentation.

 [Slides.pdf] [arXiv] [vidéo]

Dernière modification : Monday 18 March 2024

Contact pour cette page : Cyril.Banderier at lipn.univ-paris13.fr