scientific article; zbMATH DE number 1500542

MaRDI QIDQ4501561zbMATH OpenFDO

Authors Sebastian Maneth, Joost Engelfriet

Publication date 4 September 2000

zbMATH Keywords

macro tree transduction

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55)

Recommendations

• Macro Tree Translations of Linear Size Increase are MSO Definable
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• Definability results for top-down tree transducers
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• MSO definable string transductions and two-way finite-state transducers

Cited in

(8)

• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• Macro tree transducers, attribute grammars, and MSO definable tree translations.
• GETGRATS: a summary of scientific results (with annotated bibliography)
• The equivalence problem for deterministic MSO tree transducers is decidable
• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• Macro Tree Translations of Linear Size Increase are MSO Definable
• scientific article; zbMATH DE number 3866600 (Why is no real title available?)
• Determinacy and Rewriting of Top-Down and MSO Tree Transformations

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 Q4501561)