Construction of fuzzy automata from fuzzy regular expressions

Li and Pedrycz [Y. M. Li, W. Pedrycz, Fuzzy finite automata and fuzzy regular expressions with membership values in lattice ordered monoids, Fuzzy Sets and Systems 156 (2005) 68–92] have proved fundamental results that provide different equivalentways to represent fuzzy languageswithmembership values in a lattice-orderedmonoid, and generalize the well-known results of the classical theory of formal languages. In particular, they have shown that a fuzzy language over an integral lattice-ordered monoid can be represented by a fuzzy regular expression if and only if it can be recognized by a fuzzy finite automaton. However, they did not give any effective method for constructing an equivalent fuzzy finite automaton from a given fuzzy regular expression. In this paper we provide such an effective method. Transforming scalars appearing in a fuzzy regular expressionα into letters of the new extended alphabet, we convert the fuzzy regular expression α to an ordinary regular expression αR. Then, starting from an arbitrary nondeterministic finite automaton A that recognizes the language ‖αR‖ represented by the regular expression αR, we construct fuzzy finite automataAα andA r α with the same or even lessnumber of states than the automatonA , which recognize the fuzzy language ‖α‖ represented by the fuzzy regular expression α. The starting nondeterministic finite automaton A can be obtained from αR using any of the well-known constructions for converting regular expressions to nondeterministic finite automata, such as Glushkov-McNaughton-Yamada’s position automaton, Brzozowski’s derivative automaton, Antimirov’s partial derivative automaton, or Ilie-Yu’s follow automaton.

[1]  Manfred Droste,et al.  Weighted automata and multi-valued logics over arbitrary bounded lattices , 2012, Theor. Comput. Sci..

[2]  Jean-Marc Champarnaud,et al.  NFA reduction algorithms by means of regular inequalities , 2004, Theor. Comput. Sci..

[3]  W. Wechler.  The concept of fuzziness in automata and language theory , 1978 .

[4]  Lotfi A. Zadeh,et al.  Note on fuzzy languages , 1969, Inf. Sci..

[5]  Madan M. Gupta,et al.  Fuzzy automata and decision processes , 1977 .

[6]  Lucian Ilie,et al.  Algorithms for Computing Small NFAs , 2002, MFCS.

[7]  Miroslav Ciric,et al.  Fuzzy equivalence relations and their equivalence classes , 2007, Fuzzy Sets Syst..

[8]  Lotfi A. Zadeh,et al.  Information Title : Fuzzy languages and their relation to human and machine intelligence , 2022 .

[9]  Lucian Ilie,et al.  Reducing NFAs by invariant equivalences , 2003, Theor. Comput. Sci..

[10]  Manfred Droste,et al.  Weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[11]  Cristian S. Calude,et al.  Finite nondeterministic automata: Simulation and minimality , 2000, Theor. Comput. Sci..

[12]  King-Sun Fu,et al.  A Formulation of Fuzzy Automata and Its Application as a Model of Learning Systems , 1969, IEEE Trans. Syst. Sci. Cybern..

[13]  Lucian Ilie,et al.  On NFA Reductions , 2004, Theory Is Forever.

[14]  Valentin M. Antimirov.  Partial Derivatives of Regular Expressions and Finite Automaton Constructions , 1996, Theor. Comput. Sci..

[15]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[16]  W. Wee.  On generalizations of adaptive algorithms and application of the fuzzy sets concept to pattern classification , 1967 .

[17]  Orna Kupferman,et al.  Lattice Automata , 2007, VMCAI.

[18]  邱道文.  Automata theory based on complete residuated lattice—valued logic（II） , 2001 .

[19]  Daowen Qiu,et al.  Equivalence in automata theory based on complete residuated lattice-valued logic , 2007, Fuzzy Sets Syst..

[20]  Jizhong Shen,et al.  Fuzzy Language on Free Monoid , 1996, Inf. Sci..

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

[22]  Wei Cheng,et al.  Minimization algorithm of fuzzy finite automata , 2004, Fuzzy Sets Syst..

[23]  Miroslav Ciric,et al.  Factorization of Fuzzy Automata , 2007, FCT.

[24]  Manfred Droste,et al.  Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices , 2010, Developments in Language Theory.

[25]  Bernard De Baets,et al.  On the existence and construction of T-transitive closures , 2003, Inf. Sci..

[26]  Vilém Vychodil,et al.  Fuzzy equational logic , 2005, Arch. Math. Log..

[27]  Jacques Sakarovitch,et al.  Derivation of Rational Expressions with Multiplicity , 2002, MFCS.

[28]  Graham Higman,et al.  Ordering by Divisibility in Abstract Algebras , 1952 .

[29]  Hongyan Xing,et al.  Automata theory based on complete residuated lattice-valued logic , 2007, Science in China Series : Information Sciences.

[30]  Yongming Li,et al.  Minimization of states in automata theory based on finite lattice-ordered monoids , 2007, Inf. Sci..

[31]  Carlos Gershenson,et al.  Information and Computation , 2013, Handbook of Human Computation.

[32]  Miroslav Ciric,et al.  Formal power series and regular operations on fuzzy languages , 2010, Inf. Sci..

[33]  C.J.H. Mann,et al.  Fuzzy Relational Systems: Foundations and Principles , 2003 .

[34]  Daowen Qiu,et al.  Pumping lemma in automata theory based on complete residuated lattice-valued logic: A note , 2006, Fuzzy Sets Syst..

[35]  Oscar H. IBARm.  Information and Control , 1957, Nature.

[36]  Stavros Konstantinidis,et al.  Fuzzification of Rational and Recognizable Sets , 2007, Fundam. Informaticae.

[37]  K. Peeva,et al.  Computing behavior of finite fuzzy machines - Algorithm and its application to reduction and minimization , 2008, Inf. Sci..

[38]  Tatjana Petkovic,et al.  Fuzzy relation equations and reduction of fuzzy automata , 2010, J. Comput. Syst. Sci..

[39]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[40]  Miroslav Ciric,et al.  Determinization of fuzzy automata with membership values in complete residuated lattices , 2008, Inf. Sci..

[41]  Lucian Ilie,et al.  Constructing NFA s by Optimal Use of Positions in Regular Expressions , 2002, CPM.

[42]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[43]  Bell Telephone,et al.  Regular Expression Search Algorithm , 1968 .

[44]  Witold Pedrycz,et al.  Minimization of lattice finite automata and its application to the decomposition of lattice languages , 2007, Fuzzy Sets Syst..

[45]  John N. Mordeson,et al.  Minimization of Fuzzy Finite Automata , 1999, Inf. Sci..

[46]  Zhihui Li,et al.  The relationships among several types of fuzzy automata , 2006, Inf. Sci..

[47]  Lucian Ilie,et al.  Follow automata , 2003, Inf. Comput..

[48]  Daowen Qiu,et al.  Characterizations of fuzzy finite automata , 2004, Fuzzy Sets Syst..

[49]  Djelloul Ziadi,et al.  Computing the equation automaton of a regular expression in O(s2) space and time , 2001 .

[50]  Hongyan Xing,et al.  Automata theory based on complete residuated lattice-valued logic: Pushdown automata , 2009, Fuzzy Sets Syst..

[51]  Lihua Wu,et al.  Automata theory based on complete residuated lattice-valued logic: Reduction and minimization , 2010, Fuzzy Sets Syst..

[52]  Berndt Farwer,et al.  ω-automata , 2002 .

[53]  Zorana Jancic,et al.  An improved algorithm for determinization of weighted and fuzzy automata , 2011, Inf. Sci..

[54]  Yordan Kyosev,et al.  Fuzzy Relational Calculus - Theory, Applications and Software , 2004, Advances in Fuzzy Systems - Applications and Theory.

[55]  Eugene S. Santos.  Fuzzy automata and languages , 1976, Inf. Sci..

[56]  Yongming Li,et al.  Finite automata theory with membership values in lattices , 2011, Inf. Sci..

[57]  Djelloul Ziadi,et al.  An Efficient Computation of the Equation K-automaton of a Regular K-expression , 2009, Fundam. Informaticae.

[58]  L. H. Haines.  On free monoids partially ordered by embedding , 1969 .

[59]  N. C. Basak,et al.  On quotient machines of a fuzzy automaton and the minimal machine , 2002, Fuzzy Sets Syst..

[60]  Manfred Droste,et al.  Determinization of weighted finite automata over strong bimonoids , 2010, Inf. Sci..

[61]  Djelloul Ziadi,et al.  Canonical derivatives, partial derivatives and finite automaton constructions , 2002, Theor. Comput. Sci..

[62]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[63]  Miroslav Ciric,et al.  Myhill-Nerode type theory for fuzzy languages and automata , 2010, Fuzzy Sets Syst..

[64]  Witold Pedrycz,et al.  Fuzzy finite automata and fuzzy regular expressions with membership values in lattice-ordered monoids , 2005, Fuzzy Sets Syst..

[65]  Li Sheng,et al.  Regular grammars with truth values in lattice-ordered monoid and their languages , 2006, Soft Comput..

[66]  Tatjana Petkovic,et al.  Congruences and homomorphisms of fuzzy automata , 2006, Fuzzy Sets Syst..

[67]  Miroslav Ciric,et al.  Reduction of fuzzy automata by means of fuzzy quasi-orders , 2011, Inf. Sci..

[68]  Hongyan Xing,et al.  Pumping lemma in context-free grammar theory based on complete residuated lattice-valued logic , 2009, Fuzzy Sets Syst..

[69]  Ping Li,et al.  Algebraic properties of LA-languages , 2006, Inf. Sci..

[70]  Sheng Yu,et al.  Mergible states in large NFA , 2005, Theor. Comput. Sci..

[71]  V. Glushkov.  THE ABSTRACT THEORY OF AUTOMATA , 1961 .

[72]  Roberto Solis-Oba,et al.  Reducing the Size of NFAs by Using Equivalences and Preorders , 2005, CPM.

[73]  Cyril Allauzen,et al.  A Unified Construction of the Glushkov, Follow, and Antimirov Automata , 2006, MFCS.

[74]  J. Mordeson,et al.  Fuzzy Automata and Languages: Theory and Applications , 2002 .

[75]  Radim Belohlávek,et al.  Determinism and fuzzy automata , 2002, Inf. Sci..

[76]  Dietrich Kuske.  Schützenberger's theorem on formal power series follows from Kleene's theorem , 2008, Theor. Comput. Sci..

[77]  Eugene S. Santos,et al.  Maximin Automata , 1968, Inf. Control..

[78]  Miroslav Ciric,et al.  Fuzzy homomorphisms of algebras , 2009, Fuzzy Sets Syst..

[79]  Djelloul Ziadi,et al.  New Finite Automaton Constructions Based on Canonical Derivatives , 2000, CIAA.

[80]  Robert McNaughton,et al.  Regular Expressions and State Graphs for Automata , 1960, IRE Trans. Electron. Comput..