The time complexity of typechecking tree-walking tree transducers
type: Item
instance of: scholarly article
title: The time complexity of typechecking tree-walking tree transducers
zbMATH Open document ID: 1165.68039
author: Joost Engelfriet
published in: Acta Informatica
publication date: 2009-04-27T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5547499
MaRDI profile type: Publication
full work available at URL: s00236-008-0087-y
OpenAlex ID: W1989452354
cites work: Q5452362
cites work: Q3967069
cites work: Passes and paths of attribute grammars
cites work: A comparison of pebble tree transducers with macro tree transducers
cites work: Q3925893
cites work: Q4210160
cites work: A Simpler Construction for Showing the Intrinsically Exponential Complexity of the Circularity Problem for Attribute Grammars
cites work: The intrinsically exponential complexity of the circularity problem for attribute grammars
cites work: Tree automata and attribute grammars
cites work: Parallel and two-way automata on directed ordered acyclic graphs
cites work: Semantics of context-free languages
cites work: Typechecking for XML transformers
cites work: Q4411812
cites work: Macro forest transducers
cites work: Complexity of Pebble Tree-Walking Automata
cites work: Alternating tree automata
DOI: 10.1007/S00236-008-0087-Y
Recommended article: Type Checking of Tree Walking Transducers
Recommended article: The Complexity of Tree Transducer Output Languages
Recommended article: Q4414526
Recommended article: Q4415261
Recommended article: Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
Recommended article: STACS 2004
Recommended article: Formal efficiency analysis for tree transducer composition
Recommended article: The complexity of the exponential output size problem for top-down and bottom-up tree transducers
Recommended article: Q3326869
description: scientific article; zbMATH DE number 5547499