Definability results for top-down tree transducers

DOI10.1007/978-3-030-81508-0_24MaRDI QIDQ832950OpenAlexFDO

Authors Sebastian Maneth, Helmut Seidl, Martin Vu

Publication date 25 March 2022

Full work available at URL https://arxiv.org/abs/2105.14860

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Variants of top-down tree transducers with look-ahead
• scientific article; zbMATH DE number 522841
• Top-down tree transducers with two-way tree walking look-ahead
• The translation power of top-down tree-to-graph transducers
• Top-down tree transducers with deterministic top-down look-ahead

Cites work

• scientific article; zbMATH DE number 3714978 (Why is no real title available?)
• scientific article; zbMATH DE number 7003194 (Why is no real title available?)
• A survey on decidable equivalence problems for tree transducers
• Deciding equivalence of top-down XML transformations in polynomial time
• Generalized sequential machine maps
• Look-ahead removal for total deterministic top-down tree transducers
• Macro forest transducers
• Mappings and grammars on trees
• Minimizing subsequential transducers: a survey.
• On tree transducers for partial functions
• Top-down tree transducers with regular look-ahead

Cited in

(14)

• Deterministic bottom-up tree transducers and ground term rewrite systems
• Shape preserving top-down tree transducers.
• Definability Results for Top-Down Tree Transducers
• Undecidable properties of deterministic top-down tree transducers
• scientific article; zbMATH DE number 1953124 (Why is no real title available?)
• scientific article; zbMATH DE number 5654542 (Why is no real title available?)
• Variants of top-down tree transducers with look-ahead
• Functionality of compositions of top-down tree transducers is decidable
• Superlinear deterministic top-down tree transducers
• How to decide functionality of compositions of top-down tree transducers
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Top-down tree transducers with two-way tree walking look-ahead
• On the equivalence problem for letter-to-letter top-down tree transducers

This page was built for publication: Definability results for top-down tree transducers

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