摘要
本文给出了两概率自动机按顺序初始等价的充要条件,证明了初始等价的概率自动机的基矩阵秩必相等及判定极限极小概率自动机的一个充要条件.同时也更正了[1]中的一个错误。
The necessary and sufficient condition of two finite probabilistic automata are given, which are in sequence initial equivalent. It has been proved that the rank of basic matrix of initial equivalent probabilistic automata is equal each other and the necessary and sufficient condition to decide a limit minimal automata. Meanwhile the article modifies mistake in [1].
出处
《贵州科学》
1994年第1期8-11,共4页
Guizhou Science
关键词
概率自动机
等价性
极小化
probabilistic automata
equivalence
minimization
