How to decide functionality of compositions of top-down tree transducers

DOI10.1007/978-3-031-19685-0_13arXiv2209.01044OpenAlexW4312338911MaRDI QIDQ6108731

Martin Vu, Sebastian Maneth, Helmut Seidl

Publication date: 26 July 2023

Published in: Algebraic Informatics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

How to decide functionality of compositions of top-down tree transducers ⋮ Functionality of compositions of top-down tree transducers is decidable

Cites Work

• Unnamed Item
• Polynomial-time inverse computation for accumulative functions with multiple data traversals
• Definability results for top-down tree transducers
• Deciding equivalence of top-down XML transformations in polynomial time
• On tree transducers for partial functions
• Transducer-based analysis of cryptographic protocols
• Generalized sequential machine maps
• A Survey on Decidable Equivalence Problems for Tree Transducers
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Composition of top-down and bottom-up tree transductions
• Three hierarchies of transducers
• Mappings and grammars on trees
• Translations on a context free grammar
• How to decide functionality of compositions of top-down tree transducers

This page was built for publication: How to decide functionality of compositions of top-down tree transducers