This work focuses on adapting artificial intelligence techniques for urban growth modeling using multitemporal imagery. Fuzzy set theory and cellular automata are used for this purpose. Fuzzy set theory preserves the spatial continuity of the growth process through allowing a test pixel to be partially developed unlike the binary crisp system (developed/undeveloped). The development level ident...

The design and implementation of Fuzzy Intelligent systems are studied. These systems operate in conditions of uncertainty, imprecision and ambiguity. Their behavior is described by Fuzzy Algorithms (FA) in the form of Fuzzy production rules. A new approach to design of such Fuzzy systems is suggested. The approach is based on a following : (a) Fuzzy Petri Nets (FPN) as new model and tools for ...

Okhotin [9] showed an exponential trade-off in the conversion from nondeterministic unary finite automata to unambiguous nondeterministic unary finite automata. In this paper, we consider the trade-off in the case of unary symmetric difference finite automata to finitely ambiguous unary symmetric difference finite automata. Surprisingly, the trade-off is linear in the number of states of the fi...

Recognizing the activities performed by the user in an unobtrusive manner is one of the important requisites of pervasive computing. Users perform a number of activities during their day to day life. Tracking and deciding what a user is doing at a given time involves a number of challenges. The lack of a precise pattern in doing an activity at different times is one among them. The number, orde...

The paper studies the relationship among fuzzy context free languages and fuzzy push down automata. The degree of membership of the words to the fuzzy language generated by a context free grammar, calculated in a monoid, introduces an additional burden for the accepting push down weighted automaton. Even in the case of languages accepted by fuzzy deterministic push down automata, the relationsh...

Abstract We present algorithms for model checking and controller synthesis of timed automata, seeing a automaton as parallel composition large finite-state machine relatively smaller automaton, using compositional reasoning on this composition. use automata learning to learn finite approximations the component, in order reduce problem at hand or synthesis. an experimental evaluation our approach.

Based on previous work on encoding deterministic nite-state automata (DFAs) in discrete-time, second-order recurrent neural networks with sigmoidal discriminant functions, we propose an algorithm that constructs an augmented recurrent neural network that encodes fuzzy nite-state automata (FFAs). Given an arbitrary FFA, we apply an algorithm which transforms the FFA into an equivalent determinis...

We present a general coalgebraic setting in which we define finite and infinite behaviour with B\"uchi acceptance condition for systems whose type is monad. The first part of the paper devoted to presenting construction monad suitable modelling (in)finite behaviour. second focuses on concepts (coalgebraic) automaton its ($\omega$-) end Kleene-type theorems regular input. framework instantiated ...

Satellite image classification is a significant technique used in remote sensing for the computerized study and pattern recognition of satellite information, which make possible the routine explanation of a huge quantity of information. Nowadays cellular automata are implemented for simulation of satellite images and also cellular automata relates to categorization in satellite image is used si...

the starting point of this paper is given by priestley’s papers, where a theory of representation of distributive lattices is presented. the purpose of this paper is to develop a representation theory of fuzzy distributive lattices in the finite case. in this way, some results of priestley’s papers are extended. in the main theorem, we show that the category of finite fuzzy priestley space...