نتایج جستجو برای: somewhat fuzzy automata continuous function
تعداد نتایج: 1565156 فیلتر نتایج به سال:
In this paper we introduce various notions of continuous fuzzy proper functions by using the existing notions of fuzzy closure and fuzzy interior operators like Rτ -closure, Rτ -interior, etc., and present all possible relations among these types of continuities. Next, we introduce the concepts of α-quasi-coincidence, qα r -pre-neighborhood, qα r -pre-closure and qα r pre-continuous function in...
In this paper, we first define the notion of a complete general fuzzyautomaton with threshold c and construct an $H_{nu}$- group, as well as commutativehypergroups, on the set of states of a complete general fuzzy automatonwith threshold c. We then define invertible general fuzzy automata, discussthe notions of “homogeneity, “separation, “thresholdness connected, “thresholdnessinner irreducible...
In this paper 2D hexagonal finite fuzzy cellular automata defined by transition of local rules based on cell structure are studied. Here the inverse problem is also
This paper investigates the application of the computational model of Cellular Automata (CA) for pattern classification of real valued data. A special class of CA referred to as Fuzzy CA (FCA) is employed to design the pattern classifier. It is a natural extension of conventional CA, which operates on binary string employing boolean logic as next state function of a cell. By contrast, FCA emplo...
Takagi–Sugeno (TS) fuzzy systems have been employed as fuzzy controllers and fuzzy models in successfully solving difficult control and modeling problems in practice. Virtually all the TS fuzzy systems use linear rule consequent. At present, there exist no results (qualitative or quantitative) to answer the fundamentally important question that is especially critical to TS fuzzy systems as fuzz...
Neuro-fuzzy systems-the combination of artiicial neural networks with fuzzy logic-are becoming increasingly popular. However, neuro-fuzzy systems need to be extended for applications which require context (e.g., speech, handwriting, control). Some of these applications can be modeled in the form of nite-state automata. Previously, it was proved that deterministic nite-state automata (DFAs) can ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید