Definability Results for Top-Down Tree Transducers
From MaRDI portal
Publication:6169966
DOI10.1142/s0129054122440051OpenAlexW3168614566MaRDI QIDQ6169966
Helmut Seidl, Sebastian Maneth, 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
Cites Work
- Unnamed Item
- Unnamed Item
- Definability results for top-down tree transducers
- Look-ahead removal for total deterministic top-down tree transducers
- Deciding equivalence of top-down XML transformations in polynomial time
- Macro forest transducers
- Une caractérisation des fonctions séquentielles et des fonctions sous- séquentielles en tant que rélations rationnelles
- On tree transducers for partial functions
- Minimizing subsequential transducers: a survey.
- Determinization of transducers over infinite words: The general case
- Transducer-based analysis of cryptographic protocols
- Generalized sequential machine maps
- A Survey on Decidable Equivalence Problems for Tree Transducers
- Regularity and Related Problems for Deterministic Pushdown Automata
- 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
