关于代换子位移的最小分量

IF 1 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2025-08-20 DOI:10.1016/j.tcs.2025.115517

Raphaël Henry

引用次数: 0

摘要

本文研究了AZ上A是有限字母的替换问题。我们精确地刻画了替换子位移的最小分量，给出了其数量的最优界，并描述了它们的动态。这些结果的显式性提供了一种算法计算和计数给定替换子位移的最小分量的方法。

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

查看原文本刊更多论文

On the minimal components of substitution subshifts

In this paper we study substitutions on

A^{Z}

where A is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The explicitness of these results provides a method to algorithmically compute and count the minimal components of a given substitution subshift.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.