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

Simple item page
dc.creatorAubrun, Nathalie
dc.creatorSablik, Mathieu
dc.date2009-02-10
dc.date.accessioned2026-07-07T12:39:50Z
dc.date.available2026-07-07T12:39:50Z
dc.descriptionTraditionally 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.
dc.identifierhttps://arxiv.org/abs/0902.1602
dc.identifierhttp://arxiv.org/abs/0902.1602
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 99-110
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219256
dc.subjectDiscrete Mathematics
dc.titleAn Order on Sets of Tilings Corresponding to an Order on Languages
dc.typetext

Files

Collections

arXiv