Determinacy and rewriting of functional top–down and MSO tree transformations
نویسندگان
چکیده
منابع مشابه
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...
متن کاملthe effect of functional/notional approach on the proficiency level of efl learners and its evaluation through functional test
in fact, this study focused on the following questions: 1. is there any difference between the effect of functional/notional approach and the structural approaches to language teaching on the proficiency test of efl learners? 2. can a rather innovative language test referred to as "functional test" ge devised so so to measure the proficiency test of efl learners, and thus be as much reliable an...
15 صفحه اولfunctional study of p0 proteins of two cereal yellow dwarf viruses (cydv-rpv and cydv-rps) and identification of their cellular partner
نقش سرکوبگری پروتئین p0 در دو پولروویروس کوتولگی زردی غلات cydv-rpv) و (cydv-rps، متفاوت در شدت بیماریزایی، مورد مطالعه قرار گرفت. نتایج نشان داد که هر دو پروتئین p0 p0cy-rpv) و (p0cy-rps قادر به سرکوب خاموشی آر ان ای ایجاد شده توسط ترادف های تراژن سنس و تکرار معکوس در n. benthamiana هستند. نشان داده شد که هر دو پروتئین p0 می توانند تخریب پروتئین argonaute-1 را تسهیل کنند. علاوه بر این، تمایل م...
Tree-functors, determinacy and bisimulations
We study the functorial characterization of bisimulation-based equivalences over a categorical model of labeled trees. We show that, in a setting where all labels are visible, strong bisimilarity can be characterized in terms of enriched functors by relying on reflection of paths with their factorizations. For an enriched functor F , this notion requires that a path (an internal morphism in our...
متن کاملDeterminacy and the tree property
The following theorems are shown. (A) If ω2 and ω3 have the tree property and either 2א0 = א2 or Ω is measurable thenΠ2 Determinacy holds. (B) If ωn has the tree property for all n < ω, n ≥ 2, and 2<אω = אω then Projective Determinacy holds.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2017
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2016.11.001