加载中…
2013-02-23
Primitive digraphs with large exponents and slowly synchronizing automata
Dmitry S. AnanichevVladimir V. GusevMikhail V. Volkov
文献摘要
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. All these automata are tightly related to primitive digraphs with large exponent.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本