Pages that link to "Item:Q878753"
From MaRDI portal
The following pages link to Frontiers of tractability for typechecking simple XML transformations (Q878753):
Displaying 14 items.
- XML graphs in program analysis (Q532414) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Look-ahead removal for total deterministic top-down tree transducers (Q906394) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- Visibly pushdown transducers (Q1672009) (← 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 logic for document spanners (Q2322723) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- Cooperating Distributed Tree Automata (Q3166944) (← links)
- (Q5155666) (← links)
- Reasoning formally about database queries and updates (Q6535969) (← links)
