A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
From MaRDI portal
Publication:2390283
Cites work
- A comparison of tree transductions defined by monadic second order logic and by attribute grammars
- Attribute grammars and recursive program schemes. I. II
- Bottom-up and top-down tree transformations— a comparison
- Composition of top-down and bottom-up tree transductions
- Generalized sequential machine maps
- scientific article; zbMATH DE number 3858450 (Why is no real title available?)
- scientific article; zbMATH DE number 3740783 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- Macro tree transducers
- Macro tree transducers, attribute grammars, and MSO definable tree translations.
- Mappings and grammars on trees
- The equivalence of bottom-up and top-down tree-to-graph transducers
- The translation power of top-down tree-to-graph transducers
- Top-down tree transducers with deterministic top-down look-ahead
- Top-down tree transducers with regular look-ahead
Cited in
(8)- Extended multi bottom-up tree transducers
- Multiple context-free tree grammars: lexicalization and characterization
- Linear deterministic multi bottom-up tree transducers
- Linking theorems for tree transducers
- Tree transformations and dependencies
- Extended Multi Bottom-Up Tree Transducers
- Look-ahead removal for total deterministic top-down tree transducers
- Compositions of extended top-down tree transducers
This page was built for publication: A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390283)
