Multidimensional fuzzy finite tree automata

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.}

[1]  John P. Gallagher,et al.  Horn clause verification with convex polyhedral abstraction and tree automata-based refinement , 2017, Comput. Lang. Syst. Struct..

[2]  Hans-Jürgen Zimmermann,et al.  Fuzzy Set Theory - and Its Applications , 1985 .

[3]  Mohammad Mehdi Zahedi,et al.  NEW DIRECTION IN FUZZY TREE AUTOMATA , 2011 .

[4]  Peter R. J. Asveld,et al.  Algebraic aspects of families of fuzzy languages , 2001, Theor. Comput. Sci..

[5]  Hubert Comon,et al.  Tree automata techniques and applications , 1997 .

[6]  Alaa A. Kharbouch,et al.  Three models for the description of language , 1956, IRE Trans. Inf. Theory.

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Robert LIN,et al.  NOTE ON FUZZY SETS , 2014 .

[9]  Mohammad Mehdi Zahedi,et al.  Fuzzy Ontology Based Document Feature Vector Modification Using Fuzzy Tree Transducer , 2008, 2008 IEEE International Conference on Signal Image Technology and Internet Based Systems.

[10]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[11]  Yasuyoshi Inagaki,et al.  ON THE DESCRIPTION OF FUZZY MEANING OF CONTEXT-FREE LANGUAGE , 1975 .

[12]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[13]  M. M. Zahedi,et al.  Minimization of Fuzzy Finite Tree Automata , 2010 .

[14]  Djelloul Ziadi,et al.  From Tree Automata to String Automata Minimization , 2018, Theory of Computing Systems.

[15]  K. Peeva.  Fuzzy automata and languages: theory and applications , 2004 .

[16]  Symeon Bozapalidis,et al.  On the recognizability of fuzzy languages II , 2008, Fuzzy Sets Syst..

[17]  Mohammad Mehdi Zahedi,et al.  Similarity-based minimization of fuzzy tree automata , 2016 .

[18]  E. Stanley Lee,et al.  The n-dimensional fuzzy sets and Zadeh fuzzy sets based on the finite valued fuzzy sets , 2010, Comput. Math. Appl..

[19]  李永明,et al.  Model checking Fuzzy Computation Tree Logic. , 2015 .

[20]  Symeon Bozapalidis,et al.  Fuzzy tree language recognizability , 2010, Fuzzy Sets Syst..

[21]  Symeon Bozapalidis,et al.  On the recognizability of Fuzzy languages I , 2006, Fuzzy Sets Syst..

[22]  Sándor Vágvölgyi,et al.  Minimization of Deterministic Top-down Tree Automata , 2017, Acta Cybern..

[23]  Zoltán Ésik,et al.  Fuzzy tree automata , 2007, Fuzzy Sets Syst..

[24]  Klaus Meer,et al.  Generalized Finite Automata over Real and Complex Numbers , 2014, TAMC.

[25]  Stefan C. Kremer,et al.  New directions in fuzzy automata , 2005, Int. J. Approx. Reason..

[26]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.