Identity checking problem for transformation monoids

被引：0
|
作者：
Ondřej Klíma
机构：
[1] Masaryk University,Department of Mathematics and Statistics
来源：
Semigroup Forum | 2012年 / 84卷
关键词：
Checking identities; Finite semigroup; Transformation monoid; Computational complexity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We study the computational complexity of checking identities in a fixed finite monoid. We prove that this problem is coNP-complete for the monoid of all full transformations of a 4-element set. This result completes the description of the complexity of checking identities in the transformation monoids.
引用
收藏
页码：487 / 498
页数：11
相关论文
共 50 条
12345