نتایج جستجو برای: fuzzy finite automata
تعداد نتایج: 362011 فیلتر نتایج به سال:
We show that logical paradoxes based on self-reference (of which the Liar is the best known example) are equivalent to the non-existence of solutions to a numerical system of equations, the so-called truth-value equations. Furthermore, we show that in many cases a self-referential system which does not posses a crisp (Boolean) solution can be solved by expanding the solution set to include fuzz...
This paper presents a contribution to minimization of intuitionistic fuzzy automata. In this paper the concept of substitution property (SP) partition for a finite intuitionistic fuzzy automaton is formulated, and the quotient automaton with respect to an SP partition is defined.
in the last decade, cellular automata models have been widely used for simulation spatial phenomena; however, exact nature of these models have been lead to various limitations for essential simulation of these phenomena. in this research, traditional cellular automata models have been developed through fuzzy theory, in which, transition rules are expressed based on fuzzy logic control methodol...
In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Bělohlávek [Inform Sciences 143 (2002) 205–209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68–92], Ignjatović et al. [I...
In this paper the concept of prob'abilistic events is introduced and their closure properties under the operations on the set of all fuzzy events are studied. I t is shown that the mean of probabilistie events is a probabilistie event and the set of all probabilistie events is closed under the transposition and the operation of the convex-combination. A sufficient conditioll for the union and t...
1 This paper describes CINTIA, a Neuro-Fuzzy real-time controller based on Pulse Stream computation techniques and designed for applications in low power embedded systems. The proposed system mixes two di erent approaches, namely Neuro-Fuzzy Controllers and Finite State Automata. The former are implemented by means of a custom neural chip (manufactured by ES2), while the latter are implemented ...
General automata are considered with respect to normal-ization over semirings. Possibilistic automata are deened as normal pessimistic fuzzy automata. Possibilistic automata are analogous to stochas-tic automata where stochastic (+=) semirings are replaced by possi-bilistic (_=^) semirings; but where stochastic automata must be normal, fuzzy automata may be (resulting in possibilistic automata)...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید