In the current study, we define different L-valued operators on LB-valued general fuzzy automata or simply GFA, where B is considered as a complete infinitely distributive lattice of propositions about GFA. particular, this study demonstrates that successor and predecessor induce co-topologies while residuated approximation topologies state set given Further, show continuity separation properti...

We study the fuzzy extension of FL0 with semantics based on the Gödel t-norm. We show that gfp-subsumption w.r.t. a nite set of primitive de nitions can be characterized by a relation on weighted automata, and use this result to provide tight complexity bounds for reasoning in this logic.

In adaptive resonance theory network, the choice of vigilance factor (VF) and choice parameter. (CP) affects the performance of the network, such as the number of classes into which the data are classified. These parameters are typically chosen and adapted using human judgment, experience, and heuristic rules. Rather than choosing and optimizing these parameters manually, we use learning automa...

Traditional Fuzzy Automata are not sufficient to model complex real life applications such as biomedical systems where the inputs can be in terms of Fuzzy. Watson Crick Finite Automaton, which works on Double Stranded tapes was introduced a computational analyze DNA molecule for purpose. The concept Fuzziness and studied theory Automaton. thought an effective computing with problems having inco...

Model checking of linear-time properties based on possibility measures was studied in previous work (Y. Li and L. Li, Model checking of linear-time properties based on possibility measure, IEEE Transactions on Fuzzy Systems, 21(5)(2013), 842-854). However, the linear-time properties considered in the previous work was classical and qualitative, possibility information of the systems was not con...

Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...

The paradigm of deterministic nite-state automata (DFAs) and their corresponding regular languages have been shown to be very useful for addressing fundamental issues in recurrent neural networks. The issues that have been addressed include knowledge representation, extraction, and reenement as well development of advanced learning algorithms. Recurrent neural networks are also very promising t...

The application of behaviour-based control structures in user adaptive systems gives a simple way for handling online user adaptivity. The main idea of behaviour-based control systems – the intelligent adaptation of the system to the actual situation, by discrete switching to the most appropriate strategy, or by fusing the strategies appeared to be the most appropriate ones – can be easily exte...