论文信息 - Hierarchy of lattice-valued fuzzy automata and decidability of their languages

Hierarchy of lattice-valued fuzzy automata and decidability of their languages

In this paper, the role of local finiteness of truth values domain of fuzzy automata is analyzed, in which the truth value domain of fuzzy automata is the (commutative) lattice-ordered monoid. We introduce a hierarchy of lattice-valued fuzzy finite automata and the languages which were recognized by these automata. Besides, the role of local finiteness of truth value domain of fuzzy languages to the hierarchy of fuzzy automata, the role of some special archimedean t-norms in the hierarchy of fuzzy automata and the decidability of lattice-valued languages are also discussed.

Lei Li | Yongming Li | Qianqian Xue

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

[2] Witold Pedrycz,et al. Minimization of lattice finite automata and its application to the decomposition of lattice languages , 2007, Fuzzy Sets Syst..

[3] Yongming Li,et al. Approximation and robustness of fuzzy finite automata , 2008, Int. J. Approx. Reason..

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

[5] Ines Klimann,et al. Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton , 2004, Theor. Comput. Sci..

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