DocumentCode
226520
Title
Hierarchy of lattice-valued fuzzy automata and decidability of their languages
Author
Qianqian Xue ; Lei Li ; Yongming Li
Author_Institution
Coll. of Math. & Inf. Sci., Shaanxi Normal Univ., Xi´an, China
fYear
2014
fDate
6-11 July 2014
Firstpage
149
Lastpage
154
Abstract
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.
Keywords
decidability; finite automata; formal languages; Archimedean t-norms; decidability; fuzzy languages; lattice-ordered monoid; lattice-valued fuzzy finite automata; lattice-valued languages; truth value domain; Automata; Educational institutions; Electronic mail; Information science; Lattices; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Fuzzy Systems (FUZZ-IEEE), 2014 IEEE International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4799-2073-0
Type
conf
DOI
10.1109/FUZZ-IEEE.2014.6891583
Filename
6891583
Link To Document