scientific article; zbMATH DE number 1953124
From MaRDI portal
Publication:4414526
Recommendations
- Type checking of tree walking transducers
- Uniformization problems for tree-automatic relations and top-down tree transducers
- The time complexity of typechecking tree-walking tree transducers
- Definability results for top-down tree transducers
- Definability Results for Top-Down Tree Transducers
- Undecidable properties of deterministic top-down tree transducers
- On injectivity of deterministic top-down tree transducers
- scientific article; zbMATH DE number 7315101
- scientific article; zbMATH DE number 522849
Cited in
(22)- The time complexity of typechecking tree-walking tree transducers
- Macro forest transducers
- Typechecking for XML transformers
- XML with data values: Typechecking revisited.
- Visibly pushdown transducers
- XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
- Modulo constraints and the complexity of typechecking XML views
- Inferring deterministic regular expression with unorder
- XML Type Checking Using High-Level Tree Transducer
- Active XML document rewriting based on tree automata theory
- Type checking of tree walking transducers
- Node query preservation for deterministic linear top-down tree transducers
- Automata for unordered trees
- Typechecking XML views of relational databases
- XML graphs in program analysis
- Transducing Markov sequences
- On the complexity of typechecking top-down XML transformations
- Branching synchronization grammars with nested tables
- Well-definedness and semantic type-checking for the nested relational calculus
- Automata for XML -- a survey
- Frontiers of tractability for typechecking simple XML transformations
- Typechecking top-down XML transformations: Fixed input or output schemas
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4414526)
