A comparison of pebble tree transducers with macro tree transducers
From MaRDI portal
Publication:1424364
DOI10.1007/s00236-003-0120-0zbMath1060.68062OpenAlexW1966106497MaRDI QIDQ1424364
Joost Engelfriet, Sebastian Maneth
Publication date: 11 March 2004
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-003-0120-0
Related Items (15)
The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Automata for XML -- a survey ⋮ Frontiers of tractability for typechecking simple XML transformations ⋮ Deaccumulation techniques for improving provability ⋮ Forward and backward application of symbolic tree transducers ⋮ Deciding origin equivalence of weakly self-nesting macro tree transducers ⋮ Characterizing attributed tree translations in terms of macro tree transducers ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Typechecking top-down XML transformations: Fixed input or output schemas ⋮ Polynomial-time inverse computation for accumulative functions with multiple data traversals ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ A Survey on Decidable Equivalence Problems for Tree Transducers ⋮ The time complexity of typechecking tree-walking tree transducers ⋮ Two-way pebble transducers for partial functions and their composition ⋮ Macro forest transducers
This page was built for publication: A comparison of pebble tree transducers with macro tree transducers
