二进制字母上自动机群的有限性问题几乎是可确定的

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

Theoretical Computer Science Pub Date : 2025-07-18 DOI:10.1016/j.tcs.2025.115478

Andriy Russyev

引用次数: 0

摘要

建立了自动机群无穷性的一个充分条件。在二进制字母的情况下，提供了一个易于检验的替代充分条件，并且几乎所有二进制字母上的自动机都满足这个条件。

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

查看原文本刊更多论文

Finiteness problem for automaton groups over a binary alphabet is almost decidable

We establish a sufficient condition for infiniteness of automaton groups. In the case of a binary alphabet an alternative sufficient condition is provided that is easy to check and almost all automata over a binary alphabet satisfy this condition.

求助全文

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

来源期刊

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.