arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0808.3112cs.DM
收藏

关于半群自由度的可判定性

On the decidability of semigroup freeness

Julien Cassaigne, Francois Nicolas

摘要:

本文讨论了半群自由度的可判定性。更精确地说,半群S上的自由度问题定义为:给定S的有限子集X,判定S的每个元素在X上是否至多有一个因子分解。到目前为止,两个自由度问题的可判定性已被仔细检查。1953年,Sardinas和Patterson提出了一个著名的算法,用于解决自由幺半群上的自由度问题。1991年,Klarner、Birget和Satterfield证明了3 × 3整数矩阵自由度问题的不可判定性。这两个结果导致了许多后续论文的出版。本文的目的有三个方面:(i)提出关于自由性问题的一般性结果,(ii)研究各种特殊半群上自由性问题的可判定性(特别注意乘法矩阵半群),以及(iii)提出精确的,具有挑战性的公开问题,以促进这一主题的研究。

英文摘要:

This paper deals with the decidability of semigroup freeness. More precisely, the freeness problem over a semigroup S is defined as: given a finite subset X of S, decide whether each element of S has at most one factorization over X. To date, the decidabilities of two freeness problems have been closely examined. In 1953, Sardinas and Patterson proposed a now famous algorithm for the freeness problem over the free monoid. In 1991, Klarner, Birget and Satterfield proved the undecidability of the freeness problem over three-by-three integer matrices. Both results led to the publication of many subsequent papers. The aim of the present paper is three-fold: (i) to present general results concerning freeness problems, (ii) to study the decidability of freeness problems over various particular semigroups (special attention is devoted to multiplicative matrix semigroups), and (iii) to propose precise, challenging open questions in order to promote the study of the topic.

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

↑