摘要
讨论了加权有限自动机的变换幺半群,并通过加权有限自动机的同余关系,提出了语法幺半群的概念,给出了语法幺半群有限的条件,并建立了变换幺半群与语法幺半群之间的关系。最后讨论了加权有限自动机的转移幺半群。
The transformation monoid of weighted finite automata is introduced.According to the congruence relation of weighted finite automata,the concept of sytactic monoid is presented,and some conditions for syntactic monoid being finite are given,and the relationship between transformation monoid and syntactic monoid is established.Finally,the transition monoid of weighted finite automata is discussed.
作者
王拥兵
李永明
WANG Yongbing LI Yongming(School of Computer Science, Shaanxi Normal University, Xi'an 710119, Shaanxi, China School of Mathematics and Computation, Anqing Normal University, Anqing 246013, Anhui, China)
出处
《陕西师范大学学报(自然科学版)》
CAS
CSCD
北大核心
2016年第5期21-25,共5页
Journal of Shaanxi Normal University:Natural Science Edition
基金
国家自然科学基金(11271237
11301316)
安庆师范学院青年科研基金(KJ201413
KJ201214)
关键词
半环
加权有限自动机
局部有限
同态
semiring
weighted finite automata
locally finiteness
homomorphism