Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Bottom-up and top-down tree transformations— a comparison
Top-down tree transducers with regular look-ahead
IO and OI. II
Monadic second-order definable graph transductions: a survey
Alternation
Automata for XML -- a survey
Attribute grammars and recursive program schemes. I. II
Attribute grammars. Definitions, systems and bibliography
The IO- and OI-hierarchies
Indexed Grammars—An Extension of Context-Free Grammars
Generalized finite automata theory with an application to a decision problem of second-order logic
Semantics of context-free languages
Translations on a context free grammar
Equality and disequality constraints on direct subterms in tree automata
Increasing modularity and language-independency in automatically generated compilers
Composition and evaluation of attribute coupled grammars
Generalized sequential machine maps
Mappings and grammars on trees
Tree acceptors and some of their applications
Characterizations of Pushdown Machines in Terms of Time-Bounded Computers
A comparison of pebble tree transducers with macro tree transducers
Typechecking for XML transformers
Tree-Walking Automata Do Not Recognize All Regular Languages
Alternating tree automata
On the Tape Complexity of Deterministic Context-Free Languages
On tree transducers for partial functions
Macro Tree Translations of Linear Size Increase are MSO Definable
Macro forest transducers
Macro tree transducers
High level tree transducers and iterated pushdown tree transducers
Macro tree transducers, attribute grammars, and MSO definable tree translations.
The Complexity of Tree Transducer Output Languages
Time and space complexity of inside-out macro languages
Tree-size bounded alternation
The formal power of one-visit attribute grammars
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space
A comparison of tree transductions defined by monadic second order logic and by attribute grammars
A survey on decidable equivalence problems for tree transducers
XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles
The membership question for ETOL-languages is polynomially complete
FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Output string languages of compositions of deterministic macro tree transducers
The Complexity of Languages Generated by Attribute Grammars
The time complexity of typechecking tree-walking tree transducers
Type Checking of Tree Walking Transducers
Multi-Return Macro Tree Transducers
The OI-hierarchy is closed under control
Unsafe Order-2 Tree Languages Are Context-Sensitive

Cited In (4)

The time complexity of typechecking tree-walking tree transducers
Transducers of polynomial growth
Macro Tree Translations of Linear Size Increase are MSO Definable
Attributed tree transducers for partial functions

This page was built for publication: Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity

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