arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1204.0856cs.FL
收藏

Cerny猜想

The Cerny Conjecture

Mikhail Berlinkov

摘要:

Čern猜想(Čern,1964)指出每个n态\san \拥有一个长度为$(n-1)^2$的\sw \。从另一方面来看,迄今已知的n态\sa的\rl \的最佳上限等于$\frac{n^3-n}6$(Pin,1983),因此是三次的(Trahtman提出了一个稍微好一点但仍然是三次的上限$\frac{n(7n^2+6n-16)}{48}$,但这个结果的公开证明包含一个不清楚的地方),在$n$。本文将Čern猜想简化为一个更简单的猜想。特别地,我们证明了单簇自动机和二次上界的自动机关闭到单簇自动机的Čern猜想。我们的方法利用马尔可夫链理论和一个简单的事实,从线性规划。

英文摘要:

The Černý conjecture (Černý, 1964) states that each n-state \san\ possess a \sw\ of length $(n-1)^2$. From the other side the best upper bound for the \rl\ of n-state \sa\ known so far is equal to $\frac{n^3-n}6$ (Pin, 1983) and so is cubic (a slightly better though still cubic upper bound $\frac{n(7n^2+6n-16)}{48}$ has been claimed in Trahtman but the published proof of this result contains an unclear place) in $n$. In the paper the Černý conjecture is reduced to a simpler conjecture. In particular, we prove Černý conjecture for one-cluster automata and quadratic upper bounds for automata closed to one-cluster automata. Our approach utilize theory of Markov chains and one simple fact from linear programming.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑