Shape preserving tree transducers
From MaRDI portal
Cites work
- Bottom-up and top-down tree transformations— a comparison
- Composition of top-down and bottom-up tree transductions
- Decidability of the finiteness of ranges of tree transductions
- Deciding equivalence of top-down XML transformations in polynomial time
- Deciding linear height and linear size-to-height increase of macro tree transducers
- Deciding origin equivalence of weakly self-nesting macro tree transducers
- Definability Results for Top-Down Tree Transducers
- From two-way to one-way finite state transducers
- Generalized finite automata theory with an application to a decision problem of second-order logic
- Generalized sequential machine maps
- scientific article; zbMATH DE number 3714978 (Why is no real title available?)
- scientific article; zbMATH DE number 7003194 (Why is no real title available?)
- Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
- Macro tree transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Macro Tree Translations of Linear Size Increase are MSO Definable
- Mappings and grammars on trees
- Monadic second-order definable graph transductions: a survey
- On tree transducers for partial functions
- Regularity and Related Problems for Deterministic Pushdown Automata
- Shape preserving top-down tree transducers.
- The equivalence problem for deterministic MSO tree transducers is decidable
- Top-down tree transducers with regular look-ahead
- Tree acceptors and some of their applications
This page was built for publication: Shape preserving tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6861683)
