scientific article; zbMATH DE number 5654542

MaRDI QIDQ3655368zbMATH OpenFDO

Authors Sándor Vágvölgyi

Publication date 7 January 2010

zbMATH Keywords

homomorphism tree transducerregular tree grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45)

Recommendations

• Decidability of the finiteness of ranges of tree transductions
• scientific article; zbMATH DE number 4108162
• Minimization of deterministic bottom-up tree transducers
• scientific article; zbMATH DE number 1101391
• STACS 2004
• Deterministic bottom-up tree transducers and ground term rewrite systems
• Definability results for top-down tree transducers
• Definability Results for Top-Down Tree Transducers
• The power of regularity-preserving multi bottom-up tree transducers
• The Power of Extended Top-Down Tree Transducers

Cited in

(5)

• The complexity of the exponential output size problem for top-down and bottom-up tree transducers
• Approximate consistency for transformations on words and trees
• Earliest normal form and minimization for bottom-up tree transducers
• scientific article; zbMATH DE number 1530017 (Why is no real title available?)
• scientific article; zbMATH DE number 7315101 (Why is no real title available?)

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