scientific article; zbMATH DE number 1200800
From MaRDI portal
Publication:4210160
zbMath0913.68127MaRDI QIDQ4210160
Publication date: 21 September 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
semigroupsortsdenotational semanticsderivationmonoidattribute grammarstransducertop-downcontext free grammarsyntax-directed semanticsmacroinherited attributemany sorted \(\Sigma \) algebrasynthesized attributetree, circularity
Related Items (33)
Domains of partial attributed tree transducers ⋮ Decision Problems of Tree Transducers with Origin ⋮ The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Decision problems of tree transducers with origin ⋮ Branching synchronization grammars with nested tables ⋮ Automata for XML -- a survey ⋮ Deaccumulation techniques for improving provability ⋮ Forward and backward application of symbolic tree transducers ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Deciding origin equivalence of weakly self-nesting macro tree transducers ⋮ Characterizing attributed tree translations in terms of macro tree transducers ⋮ The generative power of delegation networks ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ From Tree-Based Generators to Delegation Networks ⋮ An Algebra for Tree-Based Music Generation ⋮ XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles ⋮ Compositions of extended top-down tree transducers ⋮ Multiple context-free tree grammars: lexicalization and characterization ⋮ Composition closure of linear extended top-down tree transducers ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ Tree-based generation of languages of fractals ⋮ Monadic Datalog Tree Transducers ⋮ A Kleene Theorem for Forest Languages ⋮ The time complexity of typechecking tree-walking tree transducers ⋮ Extended symbolic finite automata and transducers ⋮ Deciding equivalence of top-down XML transformations in polynomial time ⋮ Macro forest transducers ⋮ Hierarchies of tree series transformations ⋮ 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. ⋮ The complexity of the exponential output size problem for top-down and bottom-up tree transducers ⋮ Characterization of tree automata based on quantum logic ⋮ Output string languages of compositions of deterministic macro tree transducers
This page was built for publication:
