Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (15): 47-50.DOI: 10.3778/j.issn.1002-8331.2009.15.014
• 研究、探讨 • Previous Articles Next Articles
WU Zong-xian1,2,DENG Pei-min1,YI Zhong1
Received:
Revised:
Online:
Published:
Contact:
吴宗显1,2,邓培民1,易 忠1
通讯作者:
Abstract: This paper gives three different products of probabilistic finite automata and discuss their mutual relationship through homomorphism and week homomorphism，some algebraic properties of those products are investigated，and in [1] the foundation has given the decomposition of average probability finite automata，and proven average probability finite automata can be decomposed into a series connected product of a stochastic encoding source and some determination finite automata.
Key words: probabilistic finite automata, products of probabilistic finite automata, decomposition of probabilistic finite automata
摘要： 给出几种概率有限自动机的积，讨论了他们之间的相互关系，并在文献[1]的基础上利用这些积给出匀概率有限自动机的分解，证明了一个匀概率有限自动机可以分解为一个随机编码源、一个伯努利过程和一些确定有限自动机的串联积。
关键词: 概率有限自动机, 概率有限自动机的积, 概率有限自动机的分解
WU Zong-xian1,2,DENG Pei-min1,YI Zhong1. Products and decomposition of probabilistic finite automata[J]. Computer Engineering and Applications, 2009, 45(15): 47-50.
吴宗显1,2,邓培民1,易 忠1. 概率有限自动机的积和分解[J]. 计算机工程与应用, 2009, 45(15): 47-50.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2009.15.014
http://cea.ceaj.org/EN/Y2009/V45/I15/47
