WANG Yongbing1,2, LI Yongming1*
(1 School of Computer Science, Shaanxi Normal University, Xi′an 710119, Shaanxi, China;2 School of Mathematics and Computation, Anqing Normal University, Anqing 246013, Anhui, China)
Abstract:
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.
KeyWords:
semiring; weighted finite automata; locally finiteness; homomorphism
