Pages that link to "Item:Q1424364"

The following pages link to A comparison of pebble tree transducers with macro tree transducers (Q1424364):

Displaying 18 items.

• Forward and backward application of symbolic tree transducers (Q404011) (← links)
• Polynomial-time inverse computation for accumulative functions with multiple data traversals (Q526439) (← links)
• Two-way pebble transducers for partial functions and their composition (Q748432) (← links)
• The equivalence problem for deterministic MSO tree transducers is decidable (Q845868) (← links)
• Automata for XML -- a survey (Q878749) (← links)
• Frontiers of tractability for typechecking simple XML transformations (Q878753) (← links)
• Deaccumulation techniques for improving provability (Q882487) (← 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)
• Pushdown machines for the macro tree transducer (Q1089810) (← links)
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity (Q2022308) (← links)
• XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles (Q2216430) (← links)
• Deciding origin equivalence of weakly self-nesting macro tree transducers (Q2680223) (← links)
• A survey on decidable equivalence problems for tree transducers (Q2800413) (← links)
• (Q3601401) (← links)
• Circularity, composition, and decomposition results for pebble macro tree transducers (Q5503438) (← links)
• Characterizing attributed tree translations in terms of macro tree transducers (Q6104348) (← links)