scientific article; zbMATH DE number 919846

MaRDI QIDQ4890711zbMATH OpenFDO

Authors Frank Drewes

Publication date 25 August 1996

zbMATH Keywords

perform symbolic computationstree transducers

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• A lower bound on the growth of functions computed by tree transductions
• On computable tree functions
• scientific article; zbMATH DE number 3965457
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science

Cited in

(4)

• Decidability of the finiteness of ranges of tree transductions
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• A lower bound on the growth of functions computed by tree transductions
• Branching synchronization grammars with nested tables

This page was built for publication:

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