有限半群的复杂度:历史与可判定性
Complexity of Finite Semigroups: History and Decidability
AI总结:
本文综述有限半群 Krohn-Rhodes 复杂度的基本结果,并概述 Margolis、Rhodes 和 Schilling 证明其可计算性的思路,从而解决了一个悬置50余年的问题。
摘要:
在近期的论文中,Margolis、Rhodes 和 Schilling 证明了有限半群的复杂度是可计算的。这解决了一个悬而未决超过50年的问题。本文的目的是综述有限半群的 Krohn-Rhodes 复杂度的基本结果,并概述其可计算性证明。
英文摘要:
In recent papers, Margolis, Rhodes and Schilling proved that the complexity of a finite semigroup is computable. This solved a problem that had been open for more than 50 years. The purpose of this paper is to survey the basic results of Krohn-Rhodes complexity of finite semigroups and to outline the proof of its computability.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。