Scholarlink

<p>Margolis, Rhodes and Schilling recently submitted two papers that proved that the complexity of a finite semigroup is computable. 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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Complexity of Finite Semigroups: History and Decidability

  • 期刊论文

  • 发表日期：

    2025年7月29日

查看全文
  • Stuart Margolis,
  • John Rhodes,
  • Anne Schilling

摘要

Margolis, Rhodes and Schilling recently submitted two papers that proved that the complexity of a finite semigroup is computable. 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.