scientific article
From MaRDI portal
Publication:3906457
zbMath0456.68098MaRDI QIDQ3906457
Publication date: 1980
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Definability results for top-down 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 ⋮ Equivalence of finite-valued tree transducers is decidable ⋮ The equivalence problem for letter-to-letter bottom-up tree transducers is solvable ⋮ Deciding origin equivalence of weakly self-nesting macro tree transducers ⋮ How to decide functionality of compositions of top-down tree transducers ⋮ Homomorphic representations by products of tree automata ⋮ Definability Results for Top-Down Tree Transducers ⋮ Functionality of compositions of top-down tree transducers is decidable ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ Decidability of equivalence for a class of non-deterministic tree transducers ⋮ Single-valuedness of tree transducers is decidable in polynomial time ⋮ Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Deterministic bottom-up tree transducers and ground term rewrite systems ⋮ Deciding equivalence of top-down XML transformations in polynomial time ⋮ On the equivalence problem for letter-to-letter top-down tree transducers ⋮ A pumping lemma for output languages of macro tree transducers
