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

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

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

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

Journal: :Int. J. Approx. Reasoning 1993
Antonio di Nola Waldemar Kolodziejczyk Salvatore Sessa

The class of the s-transitive (resp. w-transitive) fuzzy matrices contains properly the class of the max-min transitive fuzzy matrices for which reduction models are already known. It is shown that some basic properties of these models remain valid also for s-transitive (resp. w-transitive)fuzzy matrices.

Journal: :CoRR 2014
Rahul Kumar Ajay Kumar

To deal with system uncertainty, finite automata have been generalized into fuzzy automata. Stamenkovic and Ciric proposed an approach using the position automata for the construction of fuzzy automata from fuzzy regular expressions. There exist multifarious methodologies for the construction of finite automata from regular expressions known as Thompson construction, Antimirov partial derivativ...

2011
Shivani Khurana

As we, all know that in every field it is very important to have quality of services. In the field of Real-time, applications like ATM and Wi-Fi are few examples. Some metrics for quality of services are Cost, Flexibility, Reliability and Efficiency. In this paper, we deal with quality of services in relation to admission control of the packets. In admission control, it should concentrate on sc...

2008
Ye Xia

The max-min fairness is one of the most widely used fairness concepts for resource sharing in communication networks. This paper describes some results related to it.

2007
Manfred Droste George Rahonis

We introduce a weighted logic with discounting and we establish Büchi’s and Elgot’s theorem for weighted automata over finite words and arbitrary commutative semirings. Then we investigate Büchi and Muller automata with discounting over the max-plus and the min-plus semiring. We show their expressive equivalence with weighted MSO-sentences with discounting. In this case our logic has a purely s...

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

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