@inproceedings{17c97de3eafd4538962c039abd12aa52,
title = "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.",
keywords = "Subdynamics, Subshift, Tiling, Turing machine with oracle",
author = "Nathalie Aubrun and Mathieu Sablik",
year = "2009",
month = dec,
day = "1",
language = "English",
isbn = "9783939897095",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "99--110",
booktitle = "STACS 2009 - 26th International Symposium on Theoretical Aspects of Computer Science",
note = "26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009 ; Conference date: 26-02-2009 Through 28-02-2009",
}