The realization problems related to weighted transducers over strong bimonoids

In this paper, the concepts of weighted transducers over strong bimonoids and their input-output-functions are introduced. Further more, the input-functions and output-functions induced by the input-output-functions of weighted transducers over strong bimonoids are given. It is the most important that the input-functions and output-functions of weighted transducers over strong bimonoids can be realized by weighted finite automata over strong bimonoids, and the realization does not depend on the distributive law, which also embodies the applications of weighted finite automata over strong bimonoids.

[1]  Mehryar Mohri,et al.  Minimization algorithms for sequential transducers , 2000, Theor. Comput. Sci..

[2]  M. Lothaire,et al.  Statistical Natural Language Processing , 2005 .

[3]  Fernando Pereira,et al.  Weighted Automata in Text and Speech Processing , 2005, ArXiv.

[4]  M. Droste,et al.  Handbook of Weighted Automata , 2009 .

[5]  Zhihui Li,et al.  The relationships among several types of fuzzy automata , 2006, Inf. Sci..

[6]  Mingsheng Ying,et al.  A theory of computation based on quantum logic (I) , 2004, 2005 IEEE International Conference on Granular Computing.

[7]  Manfred Droste,et al.  Weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[8]  Mehryar Mohri,et al.  The Design Principles of a Weighted Finite-State Transducer Library , 2000, Theor. Comput. Sci..

[9]  Yongming Li,et al.  Lattice-valued fuzzy Turing machines: Computing power, universality and efficiency , 2009, Fuzzy Sets Syst..

[10]  Yun Shang,et al.  A theory of computation based on unsharp quantum logic: Finite state automata and pushdown automata , 2012, Theor. Comput. Sci..

[11]  Mehryar Mohri,et al.  Finite-State Transducers in Language and Speech Processing , 1997, CL.

[12]  Yongming Li.  Lattice-valued fuzzy turing machines and their computing power , 2009, 2009 IEEE International Conference on Fuzzy Systems.

[13]  Daowen Qiu.  Automata theory based on complete residuated lattice-valued logic , 2007, Science in China Series : Information Sciences.

[14]  Manfred Droste,et al.  Determinization of weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[15]  Witold Pedrycz,et al.  Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids , 2005, Fuzzy Sets Syst..

[16]  Ping Li,et al.  Algebraic properties of LA-languages , 2006, Inf. Sci..