scientific article; zbMATH DE number 3622977

zbMath0401.68058MaRDI QIDQ4185831

Z. Zachar

Publication date: 1979

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

DecidabilityEquivalence ProblemDeterministic Bottom-Up Tree TransducersDeterministic Frontier-To-Root Tree Transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (9)

When is a functional tree transduction deterministic? ⋮ The equivalence problem for deterministic MSO tree transducers is decidable ⋮ Equivalence of finite-valued tree transducers is decidable ⋮ The equivalence problem for letter-to-letter bottom-up tree transducers is solvable ⋮ Decidability of equivalence for a class of non-deterministic tree transducers ⋮ Single-valuedness of tree transducers is decidable in polynomial time ⋮ 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

This page was built for publication: