讨论了加权有限自动机的变换幺半群,并通过加权有限自动机的同余关系,提出了语法幺半群的概念,给出了语法幺半群有限的条件,并建立了变换幺半群与语法幺半群之间的关系。最后讨论了加权有限自动机的转移幺半群。
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.