In this note first by considering the notion of general fuzzy automata (for simplicity GFA), we define the notions of direct product, restricted direct product and join of two GFA. Also, we introduce some operations on (Fuzzy) sets and then prove some related theorems. Finally we construct the general fuzzy recognizers and recognizable sets and give the notion of (trim) reversal of a given GFA....

The purpose of this paper is to give an alternative proof to the decidability of the emptiness problem for tree automata, as shown in Rabin [4]. The proof reduces the emptiness problem for automata on infinite trees to that for automata on finite trees, by showing that any automata definable set of infinite trees must contain a finitelygenerable tree. Section 1: Introduction The analysis of fin...

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.

There is a common perception that snowflakes are 6-sided and a common quip that "no two snowflakes are alike". The 6-fold symmetry suggests that the growth is deterministic, while the differences suggest the growth is so sensitive to conditions that remarkable variety appears. We investigate fuzzy automata that give a great diversity of growth patterns, have sensitivity to background conditions...

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

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