Definability Results for Top-Down Tree Transducers

DOI10.1142/S0129054122440051MaRDI QIDQ6169966zbMATH OpenOpenAlexFDO

Authors Sebastian Maneth, Helmut Seidl, Martin Vu

Publication date 15 August 2023

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054122440051

zbMATH Keywords

homomorphismlinearitytransducer

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Definability results for top-down tree transducers
• On injectivity of deterministic top-down tree transducers
• Undecidable properties of deterministic top-down tree transducers
• Equivalence of deterministic top-down tree-to-string transducers is decidable
• scientific article; zbMATH DE number 3858448
• Deterministic bottom-up tree transducers and ground term rewrite systems
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• STACS 2004

Cites work

• A survey on decidable equivalence problems for tree transducers
• Deciding equivalence of top-down XML transformations in polynomial time
• Definability results for top-down tree transducers
• Determinization of transducers over infinite words: The general case
• Generalized sequential machine maps
• scientific article; zbMATH DE number 3714978 (Why is no real title available?)
• scientific article; zbMATH DE number 7003194 (Why is no real title available?)
• 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
• Regularity and Related Problems for Deterministic Pushdown Automata
• Top-down tree transducers with regular look-ahead
• Transducer-based analysis of cryptographic protocols
• Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles

Cited in

(6)

• Deterministic bottom-up tree transducers and ground term rewrite systems
• Top-down tree transducers with two-way tree walking look-ahead
• scientific article; zbMATH DE number 5654542 (Why is no real title available?)
• scientific article; zbMATH DE number 1953124 (Why is no real title available?)
• Synthesis of deterministic top-down tree transducers from automatic tree relations
• Shape preserving 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 Q6169966)