نتایج جستجو برای: min general fuzzy automata

تعداد نتایج: 987996  

Journal: :تحقیقات کاربردی خاک 0
ایمان صالح دانشگاه علوم کشاورزی و منابع طبیعی ساری عطااله کاویان دانشگاه علوم کشاورزی و منابع طبیعی ساری زینب جعفریان دانشگاه علوم کشاورزی و منابع طبیعی ساری رضا احمدی دانشگاه علوم کشاورزی و منابع طبیعی ساری

infiltration plays an important role in surface and subsurface hydrology and it is a key factor in the rainfall and runoff equations. the use of new approaches that have no limitations of common theoretical and empirical methods to determine infiltration relationships, will minimize the necessity of time consuming and costly experiments to determine permeability values and will make it possible...

Journal: :Neurocomputing 2021

A general fuzzy min–max (GFMM) neural network is one of the efficient neuro-fuzzy systems for classification problems. However, a disadvantage most current learning algorithms GFMM that they can handle effectively numerical valued features only. Therefore, this paper provides some potential approaches to adapting problems with mixed-type or only categorical as are very common in practical appli...

Journal: :Journal of Intelligent and Fuzzy Systems 2013
Athanasios Kehagias G. Kartsiotis

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...

1996
Albert Cohen

This paper addresses the data-ow analysis of access to arrays in recursive imperative programs. When no assumption is made on recursion predicates, only approximate (\fuzzy") ow information can be hoped for in the general case. However, we introduce a new data-ow framework, based on push-down automata and, equivalently, on context-free grammars, and show that this framework allows to describe t...

2016
Thomas Colcombet Denis Kuperberg Amaldev Manuel Szymon Torunczyk

Regular cost functions form a quantitative extension of regular languages that share the array of characterisations the latter possess. In this theory, functions are treated only up to preservation of boundedness on all subsets of the domain. In this work, we subject the well known distance automata (also calledmin-automata), and their dualmax-automata to this framework, and obtain a number of ...

2006
Warren L. Davis Ladislav J. Kohout

In this paper, we extend research done in max-min fuzzy neural networks in several important ways. We replace max and min operations used in the fuzzy operations by more general t-norms and co-norms, respectively. In addition, instead of the Łukasiewicz equivalence connective used in network of ReyesGarcia and Bandler, we employ in our hybridization a variety of equivalence connectives. We expl...

Journal: :IJNCR 2010
Mika Hirvensalo

A model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum autom...

A. Ghodousian, Farnood Samie Tarane Azarnejad

 Minimum and maximum operators are two well-known t-norm and s-norm used frequently in fuzzy systems. In this paper, two different types of fuzzy inequalities are simultaneously studied where the convex combination of minimum and maximum operators is applied as the fuzzy relational composition. Some basic properties and theoretical aspects of the problem are derived and four necessary and suffi...

Journal: :CoRR 2012
Hamid A. Toussi Bahram Sadeghi Bigham

For fast and efficient analysis of large sets of fuzzy data, elimination of redundancies in the memory representation is needed. We used MTBDDs as the underlying data-structure to represent fuzzy sets and binary fuzzy relations. This leads to elimination of redundancies in the representation, less computations, and faster analyses. We have also extended a BDD package (BuDDy) to support MTBDDs i...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید