On the stability and shadowing of tree-shifts of finite type

Author:

Bucki Dawid

Abstract

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that the tree-shift is topologically stable and all shift maps are open. We also present an example of a tree-shift for which all shift maps are open but which is not of finite type. It also turns out that if a topologically stable tree-shift does not have isolated points then it is of finite type.

Funder

Narodowe Centrum Nauki

Publisher

American Mathematical Society (AMS)

Reference15 articles.

1. Decidability of conjugacy of tree-shifts of finite type;Aubrun, Nathalie,2009

2. Sofic and almost of finite type tree-shifts;Aubrun, Nathalie,2010

3. Tree-shifts of finite type;Aubrun, Nathalie;Theoret. Comput. Sci.,2012

4. Sofic tree-shifts;Aubrun, Nathalie;Theory Comput. Syst.,2013

5. Tree algebra of sofic tree languages;Aubrun, Nathalie;RAIRO Theor. Inform. Appl.,2014

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3