Composition closure of linear extended top-down tree transducers

DOI10.1007/s00224-015-9660-2zbMath1369.68252arXiv1301.1514OpenAlexW1498027662MaRDI QIDQ519891

Zoltán Fülöp, Joost Engelfriet, Andreas Maletti

Publication date: 31 March 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1301.1514

zbMATH Keywords

composition hierarchyextended top-down tree transducersynchronous grammartree bimorphismtree transformation

Mathematics Subject Classification ID

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

Related Items (2)

Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of extended top-down tree transducers
• Morphismes et bimorphismes d'arbres
• IO and OI. I
• Generalized sequential machine maps
• Linking theorems for tree transducers
• The Power of Extended Top-Down Tree Transducers
• Bottom-up and top-down tree transformations— a comparison
• Top-down tree transducers with regular look-ahead
• Macro Tree Translations of Linear Size Increase are MSO Definable
• Three hierarchies of transducers
• MINIMAL RECOGNIZERS AND SYNTACTIC MONOIDS OF DR TREE LANGUAGES
• Mappings and grammars on trees

This page was built for publication: Composition closure of linear extended top-down tree transducers