Definability results for top-down tree transducers

DOI10.1007/978-3-030-81508-0_24OpenAlexW3197392573MaRDI QIDQ832950

Helmut Seidl, Martin Vu, Sebastian Maneth

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)

Related Items (3)

How to decide functionality of compositions of top-down tree transducers ⋮ Definability Results for Top-Down Tree Transducers ⋮ Functionality of compositions of top-down tree transducers is decidable

Cites Work

• Unnamed Item
• Unnamed Item
• Look-ahead removal for total deterministic top-down tree transducers
• Deciding equivalence of top-down XML transformations in polynomial time
• Macro forest transducers
• On tree transducers for partial functions
• Minimizing subsequential transducers: a survey.
• Generalized sequential machine maps
• A Survey on Decidable Equivalence Problems for Tree Transducers
• Top-down tree transducers with regular look-ahead
• Mappings and grammars on trees

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