An Order on Sets of Tilings Corresponding to an Order on Languages

Abstract. Traditionally a tiling is defined with a finite number of finite forbidden patterns. We can generalize this notion considering any set of patterns. Generalized tilings defined in this way can be studied with a dynamical point of view, leading to the notion of subshift. In this article we establish a correspondence between an order on subshifts based on dynamical transformations on them and an order on languages of forbidden patterns based on computability properties.

• Type: Conference
• Year: 2009
• Where: STACS
• Authors: Nathalie Aubrun, Mathieu Sablik
• Keywords: Dynamical Point, STACS 2009, finite Forbidden Patterns, finite Number