scientific article; zbMATH DE number 3858448

MaRDI QIDQ3326869zbMATH OpenFDO

Authors Zoltán Ésik

Publication date 1983

zbMATH Keywords

decidabilityregular forestregularity preserving propertytop- down tree transducerstree transformations

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Formal languages and automata (68Q45)

Recommendations

• Undecidable properties of deterministic top-down tree transducers
• Decision problems of tree transducers with origin
• DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS
• Decidability of equivalence for a class of non-deterministic tree transducers
• Determinacy and subsumption for single-valued bottom-up tree transducers

Cited in

(11)

• The time complexity of typechecking tree-walking tree transducers
• Undecidable properties of deterministic top-down tree transducers
• Shape preserving top-down tree transducers.
• Linking theorems for tree transducers
• The Complexity of Tree Transducer Output Languages
• scientific article; zbMATH DE number 3856422 (Why is no real title available?)
• scientific article; zbMATH DE number 1354999 (Why is no real title available?)
• Node query preservation for deterministic linear top-down tree transducers
• DECIDABILITY OF THE SHAPE PRESERVING PROPERTY OF BOTTOM-UP TREE TRANSDUCERS
• Shape preserving bottom-up tree transducers
• Definability Results for Top-Down Tree Transducers

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 Q3326869)