The following pages link to (Q4414526):
Displaying 18 items.
- Automata for unordered trees (Q515668) (← links)
- XML graphs in program analysis (Q532414) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Branching synchronization grammars with nested tables (Q596320) (← links)
- Well-definedness and semantic type-checking for the nested relational calculus (Q870267) (← links)
- Automata for XML -- a survey (Q878749) (← links)
- Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
- Typechecking top-down XML transformations: Fixed input or output schemas (Q937295) (← links)
- The time complexity of typechecking tree-walking tree transducers (Q1014274) (← links)
- Macro forest transducers (Q1029068) (← links)
- Typechecking for XML transformers (Q1394797) (← links)
- XML with data values: Typechecking revisited. (Q1401966) (← links)
- Visibly pushdown transducers (Q1672009) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Inferring Deterministic Regular Expression with Unorder (Q3297778) (← links)
- Active XML document rewriting based on tree automata theory (Q3446029) (← links)
- Transducing Markov sequences (Q5501935) (← links)