The following pages link to Typechecking for XML transformers (Q1394797):
Displaying 46 items.
- State complexity of the concatenation of regular tree languages (Q418803) (← links)
- Synthesis of deterministic top-down tree transducers from automatic tree relations (Q515670) (← links)
- Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
- XML graphs in program analysis (Q532414) (← links)
- Structural properties of XPath fragments (Q555765) (← links)
- On the complexity of typechecking top-down XML transformations (Q555775) (← links)
- Lower bounds for the size of deterministic unranked tree automata (Q714828) (← links)
- Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
- Deciding determinism of caterpillar expressions (Q840761) (← links)
- Complementing deterministic tree-walking automata (Q845667) (← links)
- The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
- On the tree-transformation power of XSLT (Q855270) (← 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)
- Efficient inclusion checking for deterministic tree automata and XML schemas (Q1041037) (← links)
- XML with data values: Typechecking revisited. (Q1401966) (← links)
- Decision problems of tree transducers with origin (Q1641005) (← links)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
- Backward type inference for XML queries (Q2182320) (← links)
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Operational state complexity of nested word automata (Q2271464) (← links)
- A programmable editor for developing structured documents based on bidirectional transformations (Q2271900) (← links)
- Modulo constraints and the complexity of typechecking XML views (Q2272220) (← links)
- Deciding definability by deterministic regular expressions (Q2361347) (← links)
- One-variable context-free hedge automata (Q2424690) (← links)
- Boolean operations and inclusion test for attribute-element constraints (Q2503331) (← links)
- Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
- A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
- Tree Transformations and Dependencies (Q3172824) (← links)
- Controlled Term Rewriting (Q3172893) (← links)
- Decision Problems of Tree Transducers with Origin (Q3449477) (← links)
- Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies (Q3454088) (← links)
- Deterministic Caterpillar Expressions (Q3503898) (← links)
- Automata on Gauss Words (Q3618609) (← links)
- (Q5091268) (← links)
- Database Theory - ICDT 2005 (Q5316601) (← links)
- Tree Automata over Infinite Alphabets (Q5452188) (← links)
- Verification of tree-processing programs via higher-order mode checking (Q5740641) (← links)
- Characterizing attributed tree translations in terms of macro tree transducers (Q6104348) (← links)
- Pebble-depth (Q6589837) (← links)
- Transducers of polynomial growth (Q6649429) (← links)
