The relationships among several forms of weighted finite automata over strong bimonoids

Abstract Given a strong bimonoid P, we introduce three different behaviors of a weighted finite automaton over P (called a P − valued finite automaton), named the initial object semantics, final object semantics and run semantics. We define four forms for a P − valued nondeterministic finite automaton ( P − NFA) and three forms for a P − valued deterministic finite automaton ( P − DFA). Under the above-mentioned semantics, the equivalence and differences among the four forms of P − NFAs are discussed and the equivalence among the three forms of P − DFAs are given. Moreover, we show that some equivalence depends on right distributivity or left distributivity, or even requires P to degenerate into a semiring.

[1]  Yuxin Deng,et al.  Logical characterizations of simulation and bisimulation for fuzzy transition systems , 2016, Fuzzy Sets Syst..

[2]  Manfred Droste,et al.  Weighted automata and multi-valued logics over arbitrary bounded lattices , 2012, Theor. Comput. Sci..

[3]  Mingsheng Ying,et al.  Automata Theory Based on Quantum Logic II , 2000 .

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

[5]  King-Sun Fu,et al.  A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems , 1969, IEEE Trans. Syst. Sci. Cybern..

[6]  Daowen Qiu,et al.  Automata theory based on quantum logic: some characterizations , 2004, Inf. Comput..

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

[8]  K. Peeva.  Fuzzy automata and languages: theory and applications , 2004 .

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

[10]  Yongming Li,et al.  Finite automata theory with membership values in lattices , 2011, Inf. Sci..

[11]  Mingsheng Ying,et al.  Quantum logic and automata theory , 2007 .

[12]  Yun Shang,et al.  Turing machines based on unsharp quantum logic , 2011, QPL.

[13]  Lihua Xie,et al.  Finite automata approach to observability of switched Boolean control networks , 2016 .

[14]  Miroslav Ciric,et al.  Bisimulations for weighted automata over an additively idempotent semiring , 2014, Theor. Comput. Sci..

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

[16]  Mingsheng Ying,et al.  Automata Theory Based on Quantum Logic. (I) , 2000 .

[17]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

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

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

[20]  Qiu Daowen,et al.  Automata theory based on complete residuated lattice-valued logic , 2001 .

[21]  Yongzhi Cao,et al.  Supervisory control of fuzzy discrete event systems , 2004, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[22]  Zorana Jancic,et al.  An improved algorithm for determinization of weighted and fuzzy automata , 2011, Inf. Sci..

[23]  Li Ping.  The Relationships Among Several Types of Finite Automata Based on Quantum Logic , 2011 .

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

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

[26]  Yongzhi Cao,et al.  Model checking computation tree logic over finite lattices , 2016, Theor. Comput. Sci..

[27]  Ping Li,et al.  Nondeterministic fuzzy automata with membership values in complete residuated lattices , 2017, Int. J. Approx. Reason..

[28]  Yongming Li,et al.  Finite automata based on quantum logic and monadic second-order quantum logic , 2010, Science in China Series F: Information Sciences.