نتایج جستجو برای: somewhat fuzzy automata open function

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

Journal: :International Journal of Geographical Information Science 2008
S. Al-kheder J. Wang J. Shan

This paper presents a fuzzy inference guided cellular automata approach. Semantic or linguistic knowledge on urban development is expressed as fuzzy rules, based on which fuzzy inference is applied to determine the urban development potential for each pixel. A defuzzification process converts the development potential to the required neighborhood development level, which is taken by cellular au...

2014
Mauhik Thakkar Nilay Desai

The most common degradations in images is their poor contrast quality. Edge Enhancement is the art of examining images for identifying objects and judging their significance. The proposed paper uses the concept of hybrid edge detection method based on fuzzy sets and cellular learning automata to detect the gray level changes of neighbors of every pixel, and to detect the edge by using the chang...

2003
Joël Ouaknine James Worrell

The algorithmic analysis of timed automata is fundamentally limited by the undecidability of the universality problem. For this reason and others, there has been considerable interest in restricted classes of timed automata. In this paper we study the universality problem for two prominent such subclasses: open and closed timed automata. This problem is described as open in [6, 8] in the case o...

A. Saeidi Rashkolia, M. Shamsizadeh

In this paper, we prove that any BL-general fuzzy automaton (BL-GFA) and its quotient have the same behavior. In addition, we obtain the minimal quotient BL-GFA and minimal quotient transformation of the BL-GFA, considering the notion of maximal admissible partition. Furthermore, we show that the number of input symbols and time complexity of the minimal quotient transformation of a BL-GFA are ...

Journal: :J. Cellular Automata 2011
Heather Betel Paola Flocchini

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

Journal: :Advances in Complex Systems 2007
Hamid Beigy Mohammad Reza Meybodi

Cellular learning automata is a combination of learning automata and cellular automata. This model is superior to cellular learning automata because of its ability to learn and also is superior to single learning automaton because it is a collection of learning automata which can interact together. In some applications such as image processing, a type of cellular learning automata in which the ...

Journal: :Journal of Mathematical Analysis and Applications 1981

Journal: :Atlantis studies in uncertainty modelling 2021

Journal: :Historical Papers 1968

Journal: :Electronic Notes in Theoretical Computer Science 2009

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

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