Domains of partial attributed tree transducers
نویسندگان
چکیده
The domains of partial attributed tree transducers (patt’s) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt’s having monadic output are the tree languages recognized by deterministic tree walking automata. 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
Domains of Partial Attributed Tree Transducers Domains of Partial Attributed Tree Transducers
The domains of partial attributed tree transducers (patt's) are the tree languages recognized by tree walking automata in universal acceptance mode. Moreover, the domains of patt's having monadic output are the tree languages recognized by deter-ministic tree walking automata.
متن کاملMATHEMATICAL ENGINEERING TECHNICAL REPORTS Composing Stack-Attributed Tree Transducers
This paper presents a composition method for stack-attributed tree transducers. Stackattributed tree transducers extend attributed tree transducers with a pushdown stack device for attribute values. Stack-attributed tree transducers are more powerful than attributed tree transducers due to the stack mechanism. We extend the existing composition method for attributed tree transducers to the comp...
متن کاملA Two-Dimensional Hierarchy for Attributed Tree Transducers
Attributed tree transducers are formal models for studying properties of attribute grammars. In this paper we prove a two{dimen-sional hierarchy for classes of producing attributed tree transducers. The two dimensions refer to the maximum number of synthesized and inherited attributes, respectively. To this end we apply a pumping lemma for output languages of producing attributed tree transducers.
متن کاملOn the Generating Power of Deterministic Tree Transducers
Attributed tree transducers are abstract models to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context{free grammar. In this paper we show that with respect to the generating power this is not an abstraction,...
متن کاملBenefits of Tree Transducers for Optimizing Functional Programs
We present a technique to prevent the construction of intermediate data structures in functional programs, which is based on results from the theory of tree transducers. We rst decompose function deen-itions, which correspond to macro tree transducers, into smaller pieces. Under certain restrictions these pieces can be composed to an attributed tree transducer using a composition result for att...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 73 شماره
صفحات -
تاریخ انتشار 2000