scientific article; zbMATH DE number 1390067

MaRDI QIDQ4934332zbMATH OpenFDO

Authors Frank Drewes

Publication date 17 January 2000

zbMATH Keywords

top-down tree transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• The output size problem for string-to-tree transducers
• Undecidable properties of deterministic top-down tree transducers
• Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity
• scientific article; zbMATH DE number 1954390

Cited in

(5)

• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• The Complexity of Tree Transducer Output Languages
• The Power of Extended Top-Down Tree Transducers
• GETGRATS: a summary of scientific results (with annotated bibliography)
• The output size problem for string-to-tree transducers

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