摘要
给出几种概率有限自动机的积,讨论了他们之间的相互关系,并在文献[1]的基础上利用这些积给出匀概率有限自动机的分解,证明了一个匀概率有限自动机可以分解为一个随机编码源、一个伯努利过程和一些确定有限自动机的串联积。
This paper gives three different products of probabilistie 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.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第15期47-50,共4页
Computer Engineering and Applications
基金
国家自然科学基金No.60473005
广西省自然科学基金No.0640061,No.0832103
广西研究生教育创新计划(No.2007106020701M48)~~
关键词
概率有限自动机
概率有限自动机的积
概率有限自动机的分解
probabilistic finite automata
products of probabilistic finite automata
decomposition of probabilistic finite automata