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 de document :
Communication dans un congrès
Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.99-110, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science
Liste complète des métadonnées

Littérature citée [12 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00359625
Contributeur : Publications Loria <>
Soumis le : lundi 9 février 2009 - 08:38:33
Dernière modification le : mercredi 11 avril 2018 - 12:12:03
Document(s) archivé(s) le : mardi 8 juin 2010 - 22:04:06

Fichiers

aubrun_new.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

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

Citation

Nathalie Aubrun, Mathieu Sablik. An Order on Sets of Tilings Corresponding to an Order on Languages. Susanne Albers and Jean-Yves Marion. 26th International Symposium on Theoretical Aspects of Computer Science STACS 2009, Feb 2009, Freiburg, Germany. IBFI Schloss Dagstuhl, pp.99-110, 2009, Proceedings of the 26th Annual Symposium on the Theoretical Aspects of Computer Science. 〈inria-00359625〉

Partager

Métriques

Consultations de la notice

246

Téléchargements de fichiers

145