Determinacy and rewriting of functional top-down and MSO tree transformations
DOI10.1016/J.JCSS.2016.11.001zbMATH Open1356.68050OpenAlexW2557073715MaRDI QIDQ730500FDOQ730500
Authors: Sebastian Maneth, Michael Benedikt, Joost Engelfriet 
Publication date: 28 December 2016
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcss.2016.11.001
Recommendations
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations
- Determinacy and subsumption for single-valued bottom-up tree transducers
- Determinacy and query rewriting for conjunctive queries and views
- Rewriting Conjunctive Queries Determined by Views
- Datalog Rewritings of Regular Path Queries using Views
Formal languages and automata (68Q45) Data structures (68P05) Automata and formal grammars in connection with logical questions (03D05) Database theory (68P15)
Cites Work
- Bottom-up and top-down tree transformations— a comparison
- Top-down tree transducers with regular look-ahead
- Graph structure and monadic second-order logic. A language-theoretic approach
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Tree acceptors and some of their applications
- Tree transducers, L systems, and two-way machines
- Static analysis of XML security views and query rewriting
- On tree transducers for partial functions
- On injectivity of deterministic top-down tree transducers
- Weighted extended tree transducers
- The Power of Extended Top-Down Tree Transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Compositions of extended top-down tree transducers
- Macro forest transducers
- Macro tree transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Equivalence of finite-valued tree transducers is decidable
- Transductions des langages de Chomsky
- Determinacy and query rewriting for conjunctive queries and views
- Title not available (Why is that?)
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Deciding equivalence of top-down XML transformations in polynomial time
- Extended multi bottom-up tree transducers
- A survey on decidable equivalence problems for tree transducers
- Determinacy and Rewriting of Top-Down and MSO Tree Transformations
- Title not available (Why is that?)
- Determinacy and subsumption for single-valued bottom-up tree transducers
- The equivalence problem for deterministic MSO tree transducers is decidable
Cited In (2)
This page was built for publication: Determinacy and rewriting of functional top-down and MSO tree transformations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730500)
