对应于语言序的Tiling集序
An Order on Sets of Tilings Corresponding to an Order on Languages
摘要：
传统上，平铺是用有限数量的有限禁止模式来定义的。我们可以将这个概念推广到任何模式集。以这种方式定义的广义平铺可以用动力学的观点来研究，从而产生子移位的概念。在这篇文章中，我们建立了一个基于动态变换的子移位序和基于可计算性的禁止模式语言序之间的对应关系。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
