Multidimensional fuzzy finite tree automata

Abstract

This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for each dimension, a fuzzy membership grade is assigned to each tree. We study MFFTA by extending some classical problems and properties of automata and regular languages such as determinization, reduction, duality and operations on languages. Furthermore, we provided the method of converting every complete fuzzy tree automata to an MFFTA as well as an example to show the efficiency of MFFTA in comparison to FFTA.}