Macro forest transducers

DOI10.1016/J.IPL.2003.05.001zbMATH Open1178.68177OpenAlexW2035285350MaRDI QIDQ1029068FDOQ1029068

Thomas Perst, Helmut Seidl

Publication date: 9 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2003.05.001

zbMATH Keywords

XMLformal languagesmacro tree transducersinverse type inference

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Cites Work

• A comparison of pebble tree transducers with macro tree transducers
• Typechecking for XML transformers
• Macro tree transducers
• Transforming XML Documents using fxt
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (14)

• Definability Results for Top-Down Tree Transducers
• Visibly Pushdown Transducers with Look-Ahead
• On the tree-transformation power of XSLT
• Determinacy and rewriting of functional top-down and MSO tree transformations
• Deciding equivalence of top-down XML transformations in polynomial time
• The time complexity of typechecking tree-walking tree transducers
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• Deciding origin equivalence of weakly self-nesting macro tree transducers
• Backward type inference for XML queries
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
• A survey on decidable equivalence problems for tree transducers
• Visibly pushdown transducers
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Definability results for top-down tree transducers

This page was built for publication: Macro forest transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1029068)