Decidable problems in substitution shifts

IF 1.1 3区计算机科学 Q1 BUSINESS, FINANCE

Journal of Computer and System Sciences Pub Date : 2024-03-18 DOI:10.1016/j.jcss.2024.103529

Marie-Pierre Béal , Dominique Perrin , Antonio Restivo

引用次数: 0

Abstract

In this paper, we investigate the structure of the most general kind of substitution shifts, including non-minimal ones, and allowing erasing morphisms. We prove the decidability of many properties of these morphisms with respect to the shift space generated by iteration, such as aperiodicity, recognizability and (under an additional assumption) irreducibility, or minimality.

查看原文本刊更多论文

置换移动中的可解问题

在本文中，我们研究了最一般的置换移位的结构，包括非最小移位和允许擦除的态式。我们证明了关于迭代产生的移位空间，这些变形的许多性质的可判定性，如非周期性、可识别性和（在额外假设下的）不可还原性或最小性。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Journal of Computer and System Sciences 工程技术-计算机：理论方法

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

68 days

期刊介绍： The Journal of Computer and System Sciences publishes original research papers in computer science and related subjects in system science, with attention to the relevant mathematical theory. Applications-oriented papers may also be accepted and they are expected to contain deep analytic evaluation of the proposed solutions. Research areas include traditional subjects such as: • Theory of algorithms and computability • Formal languages • Automata theory Contemporary subjects such as: • Complexity theory • Algorithmic Complexity • Parallel & distributed computing • Computer networks • Neural networks • Computational learning theory • Database theory & practice • Computer modeling of complex systems • Security and Privacy.