An Order on Sets of Tilings Corresponding to an Order on Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

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

Mathieu Sablik

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.
Fichier principal
Vignette du fichier
aubrun_new.pdf (232.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00359625 , version 1 (09-02-2009)

Identifiers

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

Cite

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⟩
138 View
95 Download

Altmetric

Share

Gmail Facebook X LinkedIn More