License: 
Creative Commons Attribution-NoDerivs 3.0 Unported license (CC BY-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.STACS.2009.1833
URN: urn:nbn:de:0030-drops-18336
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/1833/
Aubrun, Nathalie ;
Sablik, Mathieu
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.
BibTeX - Entry
@InProceedings{aubrun_et_al:LIPIcs:2009:1833,
author = {Nathalie Aubrun and Mathieu Sablik},
title = {{An Order on Sets of Tilings Corresponding to an Order on Languages}},
booktitle = {26th International Symposium on Theoretical Aspects of Computer Science},
pages = {99--110},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-09-5},
ISSN = {1868-8969},
year = {2009},
volume = {3},
editor = {Susanne Albers and Jean-Yves Marion},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2009/1833},
URN = {urn:nbn:de:0030-drops-18336},
doi = {10.4230/LIPIcs.STACS.2009.1833},
annote = {Keywords: Tiling, Subshift, Turing machine with oracle, Subdynamics}
}
|
Keywords: |
|
Tiling, Subshift, Turing machine with oracle, Subdynamics |
|
Collection: |
|
26th International Symposium on Theoretical Aspects of Computer Science |
|
Issue Date: |
|
2009 |
|
Date of publication: |
|
19.02.2009 |
