arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.2295cs.FLcs.DM
收藏

自动机半群的有限性问题是不可判定的

The finiteness problem for automaton semigroups is undecidable

Pierre Gillibert

摘要:

自动机群和自动机半群的有限性问题已得到广泛的研究,并有几个部分正结果。然而,我们证明,在最一般的情况下,问题是不可判定的。我们研究了自动机半群的情形。给定一个NW-确定的Wang瓦片集,构造一个Mealy自动机,使得该平面上存在一个有效的Wang瓦片当且仅当Mealy自动机生成一个有限半群.该构造类似于卡里的构造,用于证明细胞自动机的幂零性问题是不可解的。Kari还证明了对于NW-确定的Wang tile集,平面的平铺是不可判定的。自动机半群的有限性问题是不可判定的。

英文摘要:

The finiteness problem for automaton groups and semigroups has been widely studied, several partial positive results are known. However we prove that, in the most general case, the problem is undecidable. We study the case of automaton semigroups. Given a NW-deterministic Wang tile set, we construct an Mealy automaton, such that the plane admit a valid Wang tiling if and only if the Mealy automaton generates a finite semigroup. The construction is similar to a construction by Kari for proving that the nilpotency problem for cellular automata is unsolvable. Moreover Kari proves that the tiling of the plane is undecidable for NW-deterministic Wang tile set. It follows that the finiteness problem for automaton semigroup is undecidable.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑