Reset Thresholds of Transformation Monoids

被引：0
|
作者：
I. Rystsov
M. Szykuła
机构：
[1] National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”,
[2] University of Wroclaw,undefined
[3] Faculty of Mathematics and Computer Science,undefined
来源：
Cybernetics and Systems Analysis | 2024年 / 60卷
关键词：
Čherný conjecture; finite automaton; finite monoid; transformation monoid;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Motivated by the Čherný conjecture for automata, we introduce the concept of monoidal automata, which allows us to formulate the Čherný conjecture for monoids. We obtain the upper bounds on the reset threshold of monoids with certain properties. In particular, we obtain a quadratic upper bound if the transformation monoid contains a primitive group of permutations and a singular of maximal rank with only one point of contraction.
引用
收藏
页码：189 / 197
页数：8
相关论文
共 50 条
12345