scientific article
From MaRDI portal
Publication:3925893
zbMath0472.68046MaRDI QIDQ3925893
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
attributed tree transformationsattributed tree translatorbottom-up tree transformationstop-down tree transformation
Related Items (25)
The translation power of top-down tree-to-graph transducers ⋮ Synthesized and inherited functions. A new computational model for syntax-directed semantics ⋮ Domains of partial attributed tree transducers ⋮ Tree Transformations and Dependencies ⋮ A two-dimensional hierarchy for attributed tree transducers ⋮ Composition and evaluation of attribute coupled grammars ⋮ A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead ⋮ Deaccumulation techniques for improving provability ⋮ Attribute grammars as tree transducers over cyclic representations of infinite trees and their descriptional composition ⋮ Characterizing attributed tree translations in terms of macro tree transducers ⋮ Deciding whether an attributed translation can be realized by a top-down transducer ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Context-free hypergraph grammars have the same term-generating power as attribute grammars ⋮ Tree transducers with external functions ⋮ Composing stack-attributed tree transducers ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ Monadic Datalog Tree Transducers ⋮ The time complexity of typechecking tree-walking tree transducers ⋮ The equivalence of bottom-up and top-down tree-to-graph transducers ⋮ The generating power of total deterministic tree transducers ⋮ Extended multi bottom-up tree transducers ⋮ A comparison of tree transductions defined by monadic second order logic and by attribute grammars ⋮ Macro tree transducers, attribute grammars, and MSO definable tree translations. ⋮ Output string languages of compositions of deterministic macro tree transducers ⋮ A pumping lemma for output languages of macro tree transducers
This page was built for publication:
