概率有限自动机的交换性

摘要

The concept of probabilistic finite automata ( PFA) as well as the commutative PFA is presented. Some equivalent characterizations of the commutative PFA are shown.The concept of product PFA and sum PFA is given and the sufficient and necessary conditions for the commutativity of product and sum PFA are obtained.%提出了一类概率有限自动机并给出其交换的概念，得到了此类自动机交换的一些刻画，定义了两个概率有限自动机的和与积，并且得到了和自动机、积自动机交换的充要条件。