نتایج جستجو برای: trim reversal general fuzzy automata
تعداد نتایج: 858040 فیلتر نتایج به سال:
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...
We study the state complexity of languages that can be obtained as reversals of regular languages represented by deterministic finite automata. We show that the state complexity of the reversal of a regular language with state complexity n is between logn and 2. We first prove that the upper bound is tight in the ternary case. Then we present binary languages reaching this upper bound on the re...
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...
BACKGROUND Military personnel exposed to potentially traumatic events whilst deployed on operational duties may develop psychological problems. The Royal Marines have made extensive use of Trauma Risk Management (TRiM), a peer-support system that operates through practitioners embedded within operational units. TRiM aims to promote recognition of psychological illness and to facilitate social s...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید