scientific article; zbMATH DE number 125895

MaRDI QIDQ4027634zbMATH OpenFDO

Authors Helmut Seidl

Publication date 21 February 1993

zbMATH Keywords

generalized sequential machinestree automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Equivalence of finite-valued tree transducers is decidable
• Equivalence of deterministic top-down tree-to-string transducers is decidable
• Single-valuedness of tree transducers is decidable in polynomial time
• Decomposing Finite-Valued Transducers and Deciding Their Equivalence
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable

Cited in

(14)

• On the equivalence problem for letter-to-letter top-down tree transducers
• On the lengths of values in a finite transducer
• Algorithmic aspects of decomposition and equivalence of finite-valued transducers
• Equivalence of finite-valued tree transducers is decidable
• Decidability of equivalence for a class of non-deterministic tree transducers
• scientific article; zbMATH DE number 4003554 (Why is no real title available?)
• Determinacy and subsumption for single-valued bottom-up tree transducers
• When is a functional tree transduction deterministic?
• scientific article; zbMATH DE number 7561615 (Why is no real title available?)
• The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
• DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Single-valuedness of tree transducers is decidable in polynomial time
• The equivalence problem for deterministic MSO tree transducers is decidable

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4027634)