Compositions of Weighted Extended Tree Transducers — The Unambiguous Case

DOI10.1142/S0129054123480064OpenAlexW4387180064MaRDI QIDQ6154977

Andreas Maletti

Publication date: 16 February 2024

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054123480064

zbMATH Keywords

compositiontop-down tree transducerextended tree transducerweighted tree transducer

Mathematics Subject Classification ID

Artificial intelligence (68Txx) Theory of computing (68Qxx) Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Compositions of tree series transformations
• Compositions of extended top-down tree transducers
• Morphismes et bimorphismes d'arbres
• Tree series transformations that respect copying
• Generalized sequential machine maps
• The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
• Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
• Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
• Statistical Machine Translation
• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• The Power of Extended Top-Down Tree Transducers
• Bottom-up and top-down tree transformations— a comparison
• Weighted Tree Automata and Tree Transducers
• Mappings and grammars on trees
• Compositions with Constant Weighted Extended Tree Transducers

This page was built for publication: Compositions of Weighted Extended Tree Transducers — The Unambiguous Case