How to decide functionality of compositions of top-down tree transducers
From MaRDI portal
Abstract: We prove that functionality of compositions of top-down tree transducers is decidable by reducing the problem to the functionality of one top-down tree transducer with look-ahead.
Cites work
- scientific article; zbMATH DE number 3714978 (Why is no real title available?)
- A survey on decidable equivalence problems for tree transducers
- Bottom-up and top-down tree transformations— a comparison
- Composition of top-down and bottom-up tree transductions
- Deciding equivalence of top-down XML transformations in polynomial time
- Definability results for top-down tree transducers
- Generalized sequential machine maps
- How to decide functionality of compositions of top-down tree transducers
- Mappings and grammars on trees
- On tree transducers for partial functions
- Polynomial-time inverse computation for accumulative functions with multiple data traversals
- Three hierarchies of transducers
- Top-down tree transducers with regular look-ahead
- Transducer-based analysis of cryptographic protocols
- Translations on a context free grammar
Cited in
(6)- Top-down tree transducers with two-way tree walking look-ahead
- Functionality of compositions of top-down tree transducers is decidable
- Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations
- How to decide functionality of compositions of top-down tree transducers
- When is a functional tree transduction deterministic?
- Formal efficiency analysis for tree transducer composition
This page was built for publication: How to decide functionality of compositions of top-down tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108731)
