Macro forest transducers

DOI10.1016/j.ipl.2003.05.001zbMath1178.68177OpenAlexW2035285350MaRDI QIDQ1029068

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)

Related Items (14)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Macro tree transducers
• Typechecking for XML transformers
• A comparison of pebble tree transducers with macro tree transducers
• Transforming XML Documents using fxt

This page was built for publication: Macro forest transducers