Functionality of compositions of top-down tree transducers is decidable
From MaRDI portal
Publication:6178464
DOI10.1016/j.ic.2023.105131OpenAlexW4389778718MaRDI QIDQ6178464
Helmut Seidl, Martin Vu, Sebastian Maneth
Publication date: 18 January 2024
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2023.105131
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
- Tree transducers, L systems, and two-way machines
- On tree transducers for partial functions
- Grammatical picture generation. A tree-based approach. With CD-ROM.
- 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
- Transformations and translations from the point of view of generalized finite automata theory
- Mappings and grammars on trees
- Translations on a context free grammar
- How to decide functionality of compositions of top-down tree transducers
