An Order on Sets of Tilings Corresponding to an Order on Languages
Discrete Mathematics
2009-02-11 v1
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.
Cite
@article{arxiv.0902.1602,
title = {An Order on Sets of Tilings Corresponding to an Order on Languages},
author = {Nathalie Aubrun and Mathieu Sablik},
journal= {arXiv preprint arXiv:0902.1602},
year = {2009}
}