New types of systems of fuzzy relation inequalities and equations, called weakly linear, have been recently introduced in [J. Ignjatović, M. Ćirić, S. Bogdanović, On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Fuzzy Sets and Systems 161 (2010) 3081–3113.]. The mentioned paper dealt with homogeneous weakly linear systems, composed of fuzzy relati...

There has been an increased interest in combining fuzzy systems with neural networks because fuzzy neural systems merge the advantages of both paradigms. On the one hand, parameters in fuzzy systems have clear physical meanings and rule-based and linguistic information can be incorporated into adaptive fuzzy systems in a systematic way. On the other hand, there exist powerful algorithms for tra...

Traffic models based on cellular automata have high computational efficiency because of their simplicity in describing unrealistic vehicular behavior and the versatility of cellular automata to be implemented on parallel processing. On the other hand, the other microscopic traffic models such as car-following models are computationally more expensive, but they have more realistic driver behavio...

Real world applications are dealing now with a huge amount of data, especially in the area high dimensional features. In this article, we depict simply*upper, simply*lower continuous, get several characteristics and other properties respect to upper lower simply*-continuous soft multi-functions. We also investigate relationship between soft-continuous, simply*continuous multifunction. implement...

on a hypergroupoid one can define a topology such that the hyperoperationis pseudocontinuous or continuous. in this paper we extend thisconcepts to the fuzzy case. we give a connection between the classical and thefuzzy (pseudo)continuous hyperoperations.

In this paper, we define the notion of a bipolar general fuzzy automaton, then we construct some closure operators on the set of states of a bipolar general fuzzy automaton. Also, we construct some topologies on the set of states of a bipolar general fuzzy automaton. Then we obtain some relationships between them.

In this paper, our focus of attention is the proper propagationof fuzzy degrees in determinization of $Nondeterministic$ $Fuzzy$$Finite$ $Tree$ $Automata$ (NFFTA). Initially, two determinizationmethods are introduced which have some limitations (one inbehavior preserving and other in type of fuzzy operations). Inorder to eliminate these limitations and increasing theefficiency of FFTA, we defin...

There are two kinds of bisimulation, namely crisp and fuzzy, between fuzzy structures such as automata, labeled transition systems, Kripke models interpretations in description logics. Fuzzy bisimulations automata over a complete residuated lattice have been introduced by ?iri? et al. 2012. Logical characterizations (respectively, logics) the [0,1] with Gödel t-norm provided Fan 2015 Nguyen 202...

In this paper intuitionistic fuzzy pushdown automata, acceptance by empty stack and acceptance by final states and their equivalence is proved. It follows that intuitionistic fuzzy pushdown automata with empty stack and IFPDAs are equivalent. We propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs), intuitionistic fuzzy languages generated by IFCFGs. Additionally, we introd...