Skip to Main content Skip to Navigation
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [12 references]  Display  Hide  Download
Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Monday, February 9, 2009 - 8:38:33 AM
Last modification on : Saturday, January 15, 2022 - 3:57:33 AM
Long-term archiving on: : Tuesday, June 8, 2010 - 10:04:06 PM


Files produced by the author(s)


  • HAL Id : inria-00359625, version 1
  • ARXIV : 0902.1602


Nathalie Aubrun, Mathieu Sablik. An Order on Sets of Tilings Corresponding to an Order on Languages. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. pp.99-110. ⟨inria-00359625⟩



Record views


Files downloads