计算机工程与应用 ›› 2009, Vol. 45 ›› Issue (15): 47-50.DOI: 10.3778/j.issn.1002-8331.2009.15.014

• 研究、探讨 • 上一篇    下一篇

概率有限自动机的积和分解

吴宗显1,2,邓培民1,易 忠1   

  1. 1.广西师范大学 数学科学学院,广西 桂林 541004
    2.贵阳学院 数学系,贵阳 550005
  • 收稿日期:2008-03-27 修回日期:2008-06-10 出版日期:2009-05-21 发布日期:2009-05-21
  • 通讯作者: 吴宗显

Products and decomposition of probabilistic finite automata

WU Zong-xian1,2,DENG Pei-min1,YI Zhong1   

  1. 1.College of Mathematics,Guangxi Normal University,Guilin,Guangxi 541004,China
    2.Department of Mathematics,Guiyang College,Guiyang 550005,China
  • Received:2008-03-27 Revised:2008-06-10 Online:2009-05-21 Published:2009-05-21
  • Contact: WU Zong-xian

摘要: 给出几种概率有限自动机的积,讨论了他们之间的相互关系,并在文献[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