An Order on Sets of Tilings Corresponding to an Order on Languages - Computer Science > Discrete MathematicsReportar como inadecuado




An Order on Sets of Tilings Corresponding to an Order on Languages - Computer Science > Discrete Mathematics - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: Traditionally a tiling is defined with a finite number of finite forbiddenpatterns. We can generalize this notion considering any set of patterns.Generalized tilings defined in this way can be studied with a dynamical pointof view, leading to the notion of subshift. In this article we establish acorrespondence between an order on subshifts based on dynamical transformationson them and an order on languages of forbidden patterns based on computabilityproperties.



Autor: Nathalie Aubrun IGM, Mathieu Sablik LATP

Fuente: https://arxiv.org/







Documentos relacionados