An automaton model used for validation and type checking with languages defined using R2G2 [1] is presented. First, tree-shaped data is considered to be handled by the automaton model, then the approach is extended to graph shaped data. The presented approach is based on specialized non-deterministic finite state automata. The specialisation copes with unranked tree shaped data. Graph shaped da...

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

We propose a realizability semantics for automata on infinite trees, based on categories of games built on usual simple games, and generalizing usual acceptance games of tree automata. Our approach can be summarized with the slogan “automata as objects, strategies as morphisms”. We show that the operations on tree automata used in the translations of MSOformulae to automata (underlying Rabin’s ...

We introduce tree stack automata as a new class of automata with storage and identify a restricted form of tree stack automata that recognises exactly the multiple context-free languages.

In this paper, we define a new kind of weighted tree automata where the weights are only supported by final states. We show that these automata are sequentializable and we study their closures under classical regular and algebraic operations. We then use these automata to compute the subtree kernel of two finite tree languages in an efficient way. Finally, we present some perspectives involving...

A fuzzy decision tree is an important tool for knowledge acquisition in uncertain environments. Most of the existing fuzzy decision tree algorithms do not systematically consider the impact of the non-linear characteristics of the membership degree of fuzzy sets; they are therefore unable to integrate uncertainty processing preferences into the selection of extended attributes. This paper initi...

We study cellular automata on regular rooted trees. This includes the characterization of sofic tree shifts in terms of unrestricted Rabin automata and the decidability of the surjectivity problem for cellular automata between sofic tree shifts.

fuzzy decision tree (fdt) classifiers combine decision trees with approximate reasoning offered by fuzzy representation to deal with language and measurement uncertainties. when a fdt induction algorithm utilizes stopping criteria for early stopping of the tree's growth, threshold values of stopping criteria will control the number of nodes. finding a proper threshold value for a stopping crite...