Modular tree transducers
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3125697 (Why is no real title available?)
- scientific article; zbMATH DE number 3857078 (Why is no real title available?)
- scientific article; zbMATH DE number 3858450 (Why is no real title available?)
- scientific article; zbMATH DE number 4004097 (Why is no real title available?)
- scientific article; zbMATH DE number 4035178 (Why is no real title available?)
- scientific article; zbMATH DE number 4049099 (Why is no real title available?)
- scientific article; zbMATH DE number 4090779 (Why is no real title available?)
- scientific article; zbMATH DE number 4108162 (Why is no real title available?)
- scientific article; zbMATH DE number 139619 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3615891 (Why is no real title available?)
- scientific article; zbMATH DE number 3619879 (Why is no real title available?)
- scientific article; zbMATH DE number 1456950 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3335016 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- A constructive method for abstract algebraic software specification
- A syntax directed compiler for ALGOL 60
- Attribute grammars and recursive program schemes. I. II
- Bottom-up and top-down tree transformations— a comparison
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Generalized sequential machine maps
- Graph expressions and graph rewritings
- High level tree transducers and iterated pushdown tree transducers
- IO and OI. II
- Macro tree transducers
- Mappings and grammars on trees
- On primitive recursive wordfunctions
- On the power of list iteration
- Rekursive Wortfunktionen
- Semantics of context-free languages
- The formal power of one-visit attribute grammars
- Translations on a context free grammar
Cited in
(12)- An implementation of syntax directed functional programming on nested- stack machines
- The equivalence problem for letter-to-letter bottom-up tree transducers is solvable
- The equivalence of bottom-up and top-down tree-to-graph transducers
- Tree transducers with external functions
- Deaccumulation techniques for improving provability
- Multi-Return Macro Tree Transducers
- scientific article; zbMATH DE number 4041320 (Why is no real title available?)
- A pumping lemma for output languages of macro tree transducers
- Implementation of a UU-algorithm for primitive recursive tree functions
- Implementation and Application of Automata
- Tree transformations and dependencies
- Modular tree automata
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)