An algorithm to decide inclusion for languages defined by deterministic regular tree grammars is presented. The algorithm is shown to run in polynomial time based on the number of constructors, constructor arity, and number of non-terminals. Correctness proofs are included. 1 Regular tree grammars

Abstract not found

We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel algorithm for eliminating equivalent readings and the first efficient algorithm for computing the best reading of a scope

This paper describes the precise specification, design, analysis, implementation, and measurements of an efficient algorithm for solving regular tree grammar based constraints. The particular constraints are for dead-code elimination on recursive data, but the method used for the algorithm design

Abstract. In this paper, two different ways of introducing alternation for lattice-valued (referred to as L -valued) regular tree grammars and L -valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed

HAL is a multi-disciplinary open access archive for the deposit and dissemination of sci-entific research documents, whether they are pub-lished or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et a ̀ la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d’enseignement et de recherche français ou étrangers, des laboratoires publics ou privés.

{ant oniot, luzeaux}©etca, fr

In this paper we show that the class of tree languages generated by ETOL tree systems is equal to the class of tree languages generated by distributed regular tree grammars cooperating with terminal strategy. 1 Introduction In theoretical computer science the classical theory of automata

Abstract not found

Abstract not found