概率有限自动机积的覆盖性  

On covering of products of probabilistic finite automata

作　　者：杨京开 蔡永裕[3] 程裕强[1] 黄飞丹 

机构地区：[1]玉林师范学院数学与统计学院,广西玉林537000 [2]玉林师范学院广西高校复杂系统优化与大数据处理重点实验室,广西玉林537000 [3]湖南科技大学数学与计算科学学院,湖南湘潭411201 [4]贵州工程应用技术学院理学院,贵州毕节551700

出　　处：《湖南科技大学学报（自然科学版）》2017年第4期112-117,共6页Journal of Hunan University of Science And Technology：Natural Science Edition

基　　金：广西自然科学基金资助项目(2014GXNSFBA118018;2016GXNSFBA380165);广西高校复杂系统优化与大数据处理重点实验室开放基金资助项目(2015CSOBDP0104);贵州省科技合作计划资助项目(黔科合LH字[2016]7062号)

摘　　要：提出了概率有限自动机的覆盖的定义,然后利用代数的方法讨论了概率有限自动机的全直积(限制直积)、级联积、圈积、并积的覆盖关系,证明了2个概率有限自动机的级联积(限制直积)覆盖它们的圈积(全直积),概率有限自动机的圈积的全直积覆盖它们的全直积的圈积,给出了概率有限自动机的弱同态与覆盖的关系,研究了概率有限自动机的积的覆盖关系的传递性质.The concept of covering of probabilistic finite automata was introduced, covering relationship on several kinds of products of probabilistic finite automata, such as full direct product（ restricted direct product）, cascade product, wreath product and join were discussed, it was proved that the cascade product （restricted direct product） of two probabilistic finite automata covered their wreath product（ full direct product）, full direct product of wreath product of probabilistic finite automata covered their wreath product of full direct product, the relations between weak homomorphism of probabilistic finite automata and covering of probabilistic finite automata were given, transitivity of covering of product of probabilistic finite automata were investigated.

关 键 词：概率有限自动机 积 覆盖 同态 

分 类 号：TP301.1[自动化与计算机技术—计算机系统结构]