Characterizations of fuzzy finite automata

In this paper, we establish some important concepts in fuzzy finite automata (FFAs) with bifuzzy property, and clarify their essential relationships. First we present a number of basic definitions and properties in FFAs. We then define a bifuzzy family of subautomata, bifuzzy source and successor operators, as well as demonstrate the bifuzzy topological characterization of FFAs. Also we clarify the relationships between our results and previous ones, and thus derive a relation figure visualizing their connections. Afterwards, we investigate further the bifuzzy separability, retrievability, and homomorphism; fuzzy continuous mapping and open mapping are also incorporated. In particular, we prove a number of equivalent characterizations for these concepts, and expound the relationships amongst them. This also concludes that both the bifuzzy source and successor operators are fuzzy closure operators. We discover that our investigation generalizes, to some extent, the algebraic fuzzy automata elaborated by Malik, Mordeson, and others. Finally, the main results obtained are summarized; the potential applications are indicated, and a number of related problems for further study are addressed.

[1]  R. Lowen.  Fuzzy topological spaces and fuzzy compactness , 1976 .

[2]  Atwell R. Turquette,et al.  On the Many-Valued Logics , 1941 .

[3]  Arun K. Srivastava,et al.  A Topology for Automata: A Note , 1976, Inf. Control..

[4]  Zamir Bavel.  Introduction to the theory of automata , 1983 .

[5]  J. Mordeson,et al.  On subsystems of a fuzzy finite state machine , 1994 .

[6]  Marvin Minsky,et al.  Computation : finite and infinite machines , 2016 .

[7]  Ewa Orlowska,et al.  Semantic Analysis of Inductive Reasoning , 1986, Theor. Comput. Sci..

[8]  John N. Mordeson,et al.  Products of fuzzy finite state machines , 1997, Fuzzy Sets Syst..

[9]  Karvel K. Thornber,et al.  Fuzzy finite-state automata can be deterministically encoded into recurrent neural networks , 1998, IEEE Trans. Fuzzy Syst..

[10]  Pratyayananda Das,et al.  A fuzzy topology associated with a fuzzy finite state machine , 1999, Fuzzy Sets Syst..

[11]  Samuel Eilenberg,et al.  Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[12]  Bobby Schmidt,et al.  Fuzzy math , 2001 .

[13]  Yiyu Yao,et al.  Generalization of Rough Sets using Modal Logics , 1996, Intell. Autom. Soft Comput..

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

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

[16]  M. Ying.  A new approach for fuzzy topology (II) , 1991 .

[17]  J. Mordeson,et al.  Fuzzy Discrete Structures , 2000 .

[18]  Abraham Kandel,et al.  Fuzzy Switching and Automata: Theory and Applications , 1979 .

[19]  John N. Mordeson,et al.  On Fuzzy Regular Languages , 1996, Inf. Sci..

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

[21]  Richard E. Ladner,et al.  Application of Model Theoretic Games to Discrete Linear Orders and Finite Automata , 1977, Inf. Control..

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

[23]  Noga Alon,et al.  Efficient simulation of finite automata by neural nets , 1991, JACM.

[24]  John N. Mordeson,et al.  Structure of upper and lower approximation spaces of infinite sets , 2002 .

[25]  Azaria Paz,et al.  Introduction to Probabilistic Automata , 1971 .

[26]  W. Holcombe.  Algebraic automata theory: Contents , 1982 .

[27]  Jan Pavelka,et al.  On Fuzzy Logic I Many-valued rules of inference , 1979, Math. Log. Q..