Determinacy and Subsumption for Single-Valued Bottom-Up Tree Transducers
نویسندگان
چکیده
This paper discusses the decidability of determinacy and subsumption for tree transducers. For two tree transducers T1 and T2, T1 determines T2 if the output of T2 is identified by the output of T1, that is, there is a partial function f such that [[T2]] = f ◦ [[T1]] where [[T1]] and [[T2]] are tree transformation relations induced by T1 and T2, respectively. Also, T1 subsumes T2 if T1 determines T2 and the partial function f such that [[T2]] = f◦[[T1]] can be defined by a transducer in a designated class that T2 belongs to. In this paper, we show that determinacy is decidable for single-valued linear extended bottom-up tree transducers as the determiner class and single-valued bottom-up tree transducers as the determinee class. We also show that subsumption is decidable for these classes.
منابع مشابه
Determinacy and Rewriting of Top-Down and MSO Tree Transformations
A query is determined by a view, if the result to the query can be reconstructed from the result of the view. We consider the problem of deciding for two given tree transformations, whether one is determined by the other. If the view transformation is induced by a tree transducer that may copy, then determinacy is undecidable, even for identity queries. For a large class of non-copying views, n...
متن کاملExtended Multi Bottom-Up Tree Transducers Composition and Decomposition
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top-down tree transducers, which are a th...
متن کاملSingle-Valuedness of Tree Transducers is Decidable in Polynomial Time
Seidl, H., Single-valuedness of tree transducers is decidable in polynomial time, Theoretical Computer Science 106 (1992) 135-181. A bottom-up finite-state tree transducer (FST) A is called single-valued iff for every input tree there is at most one output tree. We give a polynomial-time algorithm which decides whether or not a given FST is single-valued. The algorithm is based on: . the freedo...
متن کاملComposition and Decomposition of Extended Multi Bottom-Up Tree Transducers?
Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...
متن کاملCompositions of Bottom-Up Tree Series Transformations
Tree series transformations computed by bottom-up tree series transducers are called bottom-up tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottom-up tree series transformations over commutative and א0-complete semirings are closed under left-composition with linear bottom-up tree series transformations and right-composition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEICE Transactions
دوره 99-D شماره
صفحات -
تاریخ انتشار 2013