scientific article
From MaRDI portal
Publication:4027634
zbMath0758.68049MaRDI QIDQ4027634
Publication date: 21 February 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
When is a functional tree transduction deterministic? ⋮ 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 ⋮ On the equivalence problem for letter-to-letter top-down tree transducers ⋮ On the lengths of values in a finite transducer