constructing fuzzy tree automata by property diagram

fuzzy tree automata (fta) are mathematical devices for modeling and processing vaguely defined trees. the behavior of an fta is a mapping from a set of regular trees on ranked alphabets to fuzzy membership grades. in other words, fta act as nonlinear fuzzy membership functions that assign membership grade to each tree based on its structural properties. on the other hand, if some structural properties define a set of regular trees, it may be possible to define its corresponding fta. this paper introduces the notion of fuzzy property diagram to organize complex properties in a graph structure to employ it in construction of fta. as well, we present some algorithms and methods for constructing a property diagram from a set of properties and defining the corresponding fta.