An Automata Theoretic Approach to the Theory of Rational Tree Relations
نویسنده
چکیده
We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions by Raoult (Bull. Belg.Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness problem). The second contribution of this paper is a new subclass of the rational tree relations, called separate-rational tree relations, defined via a natural restriction on asynchronous tree automata. These relations are closed under composition, preserve regular tree languages, and generate precisely the regular sets in the unary case (all these properties fail for the general model), and they are still more powerful than, for instance, the automatic tree relations.
منابع مشابه
An Automata Theoretic Approach to Rational Tree Relations
We investigate rational relations over trees. Our starting point is the definition of rational tree relations via rational expressions byRaoult (Bull. Belg.Math. Soc. 1997). We develop a new class of automata, called asynchronous tree automata, which recognize exactly these relations. The automata theoretic approach is convenient for the solution of algorithmic problems (like the emptiness prob...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملAn Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract)
Translating linear temporal logic formulas to automata has proven to be an effective approach for implementing linear-time model-checking, and for obtaining many extensions and improvements to this verification method. On the other hand, for branching temporal logic, automata-theoretic techniques have long been thought to introduce an exponential penalty, making them essentially useless for mod...
متن کاملSimulation and Evaluation of Urban Development Scenarios Using Integration of Cellular Automata Model and Game Theory
Urban growth is a dynamic and evolutionary spatial and social process that relates to the changes of urban spatial units and the transformation of people’s lifestyles and consequently demographic changes. Considering the urban development process as a function of land uses interactions, population structure and the strategic behavior of the agents involved in the urban development process (the ...
متن کاملUniform strategies, rational relations and jumping automata
A general concept of uniform strategies has recently been proposed as a relevant notion in game theory for computer science, which subsumes various notions from the literature. It relies on properties involving sets of plays in two-player turn-based arenas equipped with arbitrary binary relations between plays; these properties are expressed in a language based on CTL∗ with a quantifier over re...
متن کامل