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

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

nowadays, wireless sensor network has been of interest to investigators and the greatest challenge in this part is the limited energy of sensors. sensors usually are in the harsh environments and transit in these environments is hard and impossible and moreover the nodes use non- replaceable batteries. because of this, saving energy is very important. in this paper we tried to decrease hard and...

This paper provides an algorithm to compute the complement of tree languages recognizable with A-TA (tree automata with associativity axioms [16]). Due to this closure property together with the previously obtained results, we know that the class is boolean closed, while keeping recognizability of A-closures of regular tree languages. In the proof of the main result, a new framework of tree aut...

The choice of membership functions plays an essential role in the success of fuzzy systems. This is a complex problem due to the possible lack of knowledge when assigning punctual values as membership degrees. To face this handicap, we propose a methodology called Ignorance functions based Interval-Valued Fuzzy Decision Tree with genetic tuning, IIVFDT for short, which allows to improve the per...

We present an efficient algorithm to reduce the size of nondeterministic tree automata, while retaining their language. It is based on new transition pruning techniques, and quotienting of the state space w.r.t. suitable equivalences. It uses criteria based on combinations of downward and upward simulation preorder on trees, and the more general downward and upward language inclusions. Since tr...

We consider the representational state complexity of unranked tree automata. The bottomup computation of an unranked tree automaton may be either deterministic or nondeterministic, and further variants arise depending on whether the horizontal string languages defining the transitions are represented by a DFA or an NFA. Also, we consider for unranked tree automata the alternative syntactic defi...

This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that this class has a good potential for application in e.g. software verification. These tree automata are obtained by extending the standard Horn clause representations with equational conditions and rewrite systems. We show in particular that a generalize...

Path query is one of the most frequently used components by the various XML query languages. Most of the proposed methods compute path queries in instance space, i.e. directly facing the XML instances, such as XML tree traversal and containment join ways. As a query method based on automata technique, automata match (AM) can evaluate path expression queries in schema space so that it allows eff...

The aim of this thesis is to provide verification techniques based on formal language theory and graph theory for graph transformation systems. Graph transformation systems can be used in a large number of application areas. In many cases it is very natural to model concurrent and distributed systems or other systems, where evolving graph-like structures play a role, by means of graph transform...