نتایج جستجو برای: bl general fuzzy automata
تعداد نتایج: 830083 فیلتر نتایج به سال:
1 This paper describes DANIELA, a Neuro-Fuzzy system for control applications. The system is based on a custom neural device that can implement either Multi-Layer Perceptrons, Radial Basis Functions or Fuzzy paradigms. The system implements intelligent control algorithms mixing neuro-fuzzy algorithms with nite state automata and is used to control a walking hexapod.
Edge Detection is an important task for sharpening the boundary of images to detect the region of interest. This paper applies a linear cellular automata rules and a Mamdani Fuzzy inference model for edge detection in both monochromatic and the RGB images. In the uniform cellular automata a transition matrix has been developed for edge detection. The Results have been compared to the ...
BL-algebras have been invented by P. Hájek [3] in order to provide an algebraic proof of the completeness theorem of “Basic Logic” (BL, for short) arising from the continuous triangular norms, familiar in the fuzzy logic framework. The above notion is generalized to an algebraic system in which the required conditions are fulfilled (Definition 2.1). Filters in BL-algebras are also defined. A fi...
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...
Fuzzy cellular automata (FCA) are cellular automata where the local rule is defined as the “fuzzification" of the local rule of the corresponding Boolean cellular automaton in disjunctive normal form. In this paper we are interested in two separate issues: the relationship between Boolean and fuzzy models, and the asymptotic behavior of elementary fuzzy cellular automata. On the first issue, we...
Fuzzy logics are designed to support logical inferences on vague or uncertain premises, and they are useful in several theoretical and applicative areas of computer science. A central paradigm in mathematical fuzzy logic, popularized by Hájek [Háj98], is based on the idea of weakening Boolean logic starting from a suitable generalization of Boolean conjunction, namely, a class of [0, 1]-valued ...
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...
The logical foundations of processes handling uncertainty in information use some classes of algebras as algebraic semantics. Bounded residuated lattice ordered monoids (Rl-monoids) are common generalizations of BL-algebras, i.e., algebras of the propositional basic fuzzy logic, and Heyting algebras, i.e., algebras of the propositional intuitionistic logic. From the point of view of uncertain i...
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...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید