We show that the methodology for testing the existence and computation the greatest simulations and bisimulations, developed in the framework of fuzzy automata [M. Ćirić et al., Fuzzy Sets and Systems 186 (2012) 100–139, 208 (2012) 22–42], can be applied in a similar form to weighted automata over an additively idempotent semiring. We define two types of simulations and four types of bisimulati...

compensatory genetic fuzzy neural networks and their applications neural networks fuzzy logic and genetic algorithms by rajasekaran and g a v pai ebook free download nonlinear workbook chaos fractals cellular automata neural networks genetic algorithms gene expression programming wavelets fuzzy logic with c java and symbolicc programs applications of neural networks in environment energy and he...

This article deals with the recognition of recurring multivariate time series patterns modelled sample-point-wise by parametric fuzzy sets. An efficient classification-based approach for the online recognition of incompleted developing patterns in streaming time series is being presented. Furthermore, means are introduced to enable users of the recognition system to restrict results to certain ...

In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

An often raised objection to fuzzy logic can be articulated as follows. Fuzzy sets are intended to represent vague collections of objects. On the one hand, boundaries of such collections are inherently imprecise. On the other hand, fuzzy sets are defined by membership degrees which are precise. There is, therefore, an obvious discrepancy between the imprecision of a collection and the precision...

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

Fuzzy cellular automata (FCA) are continuous cellular automata where the local rule is defined as the “fuzzification” of the local rule of a corresponding Boolean cellular automaton in disjunctive normal form. In this paper, we consider circular FCA; their asymptotic behaviours had previously been observed through simulation and FCA had been empirically classified accordingly. However, no analy...