Pages that link to "Item:Q555775"
From MaRDI portal
The following pages link to On the complexity of typechecking top-down XML transformations (Q555775):
Displaying 11 items.
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- On the minimization of XML schemas and tree automata for unranked trees (Q882435) (← links)
- Schemas for unordered XML on a DIME (Q905687) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Deciding equivalence of top-down XML transformations in polynomial time (Q1021574) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- Conjunctive query containment over trees using schema information (Q1702301) (← links)
- Bottom-up unranked tree-to-graph transducers for translation into semantic graphs (Q2029483) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- A Survey on Decidable Equivalence Problems for Tree Transducers (Q2800413) (← links)
