Definability results for top-down tree transducers
From MaRDI portal
Publication:832950
DOI10.1007/978-3-030-81508-0_24OpenAlexW3197392573MaRDI QIDQ832950FDOQ832950
Authors: Sebastian Maneth, Helmut Seidl, Martin Vu 
Publication date: 25 March 2022
Full work available at URL: https://arxiv.org/abs/2105.14860
Recommendations
Cites Work
- Top-down tree transducers with regular look-ahead
- Generalized sequential machine maps
- Mappings and grammars on trees
- On tree transducers for partial functions
- Macro forest transducers
- Minimizing subsequential transducers: a survey.
- Title not available (Why is that?)
- Deciding equivalence of top-down XML transformations in polynomial time
- A survey on decidable equivalence problems for tree transducers
- Title not available (Why is that?)
- Look-ahead removal for total deterministic top-down tree transducers
Cited In (14)
- Deterministic bottom-up tree transducers and ground term rewrite systems
- Definability Results for Top-Down Tree Transducers
- Title not available (Why is that?)
- Top-down tree transducers with two-way tree walking look-ahead
- Shape preserving top-down tree transducers.
- Undecidable properties of deterministic top-down tree transducers
- Variants of top-down tree transducers with look-ahead
- On the equivalence problem for letter-to-letter top-down tree transducers
- Functionality of compositions of top-down tree transducers is decidable
- How to decide functionality of compositions of top-down tree transducers
- Superlinear deterministic top-down tree transducers
- Title not available (Why is that?)
- Synthesis of deterministic top-down tree transducers from automatic tree relations
- Synthesis of deterministic top-down tree transducers from automatic tree relations
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 Q832950)
