Slightly nonlinear higher-order tree transducers

Cites work

10th Asian Logic Conference
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
Attribute Grammars and Categorical Semantics
Attribute grammars and their applications. International conference WAGA, Paris, France, 19-21 Sept. 1990. Proceedings
Computation by interaction for space-bounded functional programming
Geometry of synthesis: a structured approach to VLSI design
Graph structure and monadic second-order logic. A language-theoretic approach
Graph-walking automata: from whence they come, and whither they are bound
High level tree transducers and iterated pushdown tree transducers
scientific article; zbMATH DE number 7559409 (Why is no real title available?)
Implicit automata in -calculi. III: Affine planar string-to-string functions
Implicit automata in typed -calculi I: aperiodicity in a non-commutative logic
Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Macro tree transducers, attribute grammars, and MSO definable tree translations.
On reversible transducers
On the expressivity of linear recursion schemes
Parallel and two-way automata on directed ordered acyclic graphs
Reversible, irreversible and optimal \(\lambda\)-machines
Simple parsimonious types and logarithmic space
Simply typed fixpoint calculus and collapsible pushdown automata
Space-Efficient Computation by Interaction
Streaming tree transducers
The many facets of string transducers (invited talk)
The structural \(\lambda \)-calculus
The time complexity of typechecking tree-walking tree transducers
Tree-Walking Automata Do Not Recognize All Regular Languages
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles

This page was built for publication: Slightly nonlinear higher-order tree transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7287807)