DocumentCode
3166647
Title
Fuzzy regular tree expressions
Author
Xiaofeng Huang ; Zhiwen Mo ; Lan Shu
Author_Institution
Coll. of Math. & Software Sci., Sichuan Normal Univ., Chengdu, China
fYear
2013
fDate
24-28 June 2013
Firstpage
703
Lastpage
708
Abstract
The concept of fuzzy tree substitution, fuzzy tree concatenation and fuzzy tree closure are defined, it is shown that we can obtain fuzzy regular tree languages by substitution, concatenation, closure operation on the fuzzy regular tree languages. Finally, we introduce the notion of fuzzy regular tree expressions, and the equivalences of fuzzy regular tree expressions and fuzzy tree automata is proved.
Keywords
automata theory; equivalence classes; formal languages; fuzzy set theory; trees (mathematics); equivalence; fuzzy regular tree expressions; fuzzy regular tree language; fuzzy tree automata; fuzzy tree closure; fuzzy tree concatenation; fuzzy tree substitution; Automata; Educational institutions; Finite element analysis; Grammar; Software; Vegetation; fuzzy regular tree expressions; fuzzy tree automata; fuzzy tree substitution;
fLanguage
English
Publisher
ieee
Conference_Titel
IFSA World Congress and NAFIPS Annual Meeting (IFSA/NAFIPS), 2013 Joint
Conference_Location
Edmonton, AB
Type
conf
DOI
10.1109/IFSA-NAFIPS.2013.6608486
Filename
6608486
Link To Document