Modular tree transducers
From MaRDI portal
Publication:807012
DOI10.1016/0304-3975(91)90353-4zbMATH Open0729.68018OpenAlexW80136255MaRDI QIDQ807012FDOQ807012
Heiko Vogler, Joost Engelfriet
Publication date: 1991
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(91)90353-4
Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- A syntax directed compiler for ALGOL 60
- Title not available (Why is that?)
- Title not available (Why is that?)
- Bottom-up and top-down tree transformations— a comparison
- IO and OI. II
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Attribute grammars and recursive program schemes. I. II
- Semantics of context-free languages
- Translations on a context free grammar
- Title not available (Why is that?)
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Generalized sequential machine maps
- Title not available (Why is that?)
- Mappings and grammars on trees
- Title not available (Why is that?)
- Macro tree transducers
- High level tree transducers and iterated pushdown tree transducers
- Title not available (Why is that?)
- Title not available (Why is that?)
- The formal power of one-visit attribute grammars
- A constructive method for abstract algebraic software specification
- On the power of list iteration
- Graph expressions and graph rewritings
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On primitive recursive wordfunctions
- Rekursive Wortfunktionen
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
- Deaccumulation techniques for improving provability
- Tree Transformations and Dependencies
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Tree transducers with external functions
- Implementation and Application of Automata
- An implementation of syntax directed functional programming on nested- stack machines
- Implementation of a UU-algorithm for primitive recursive tree functions
- Streaming Tree Transducers
- A pumping lemma for output languages of macro tree transducers
Uses Software
Recommendations
This page was built for publication: Modular tree transducers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807012)