首页    期刊浏览 2025年08月21日 星期四
登录注册

文章基本信息

  • 标题:Algorithmic Complexity for the Realization of an Effective Subshift By a Sofic
  • 本地全文:下载
  • 作者:Mathieu Sablik ; Michael Schraudner
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2016
  • 卷号:55
  • 页码:110:1-110:14
  • DOI:10.4230/LIPIcs.ICALP.2016.110
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:Realization of d-dimensional effective subshifts as projective sub-actions of d + d'-dimensional sofic subshifts for d' >= 1 is now well known [Hochman, 2009; Durand/Romashchenko/Shen, 2012; Aubrun/Sablik, 2013]. In this paper we are interested in qualitative aspects of this realization. We introduce a new topological conjugacy invariant for effective subshifts, the speed of convergence, in view to exhibit algorithmic properties of these subshifts in contrast to the usual framework that focuses on undecidable properties.
  • 关键词:Subshift; computability; time complexity; space complexity; tilings
国家哲学社会科学文献中心版权所有