Compositions of Weighted Extended Tree Transducers — The Unambiguous Case

DOI10.1142/S0129054123480064OpenAlexW4387180064MaRDI QIDQ6154977FDOQ6154977

Authors: 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

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

Cites Work

• OpenFst: A General and Efficient Weighted Finite-State Transducer Library
• Bottom-up and top-down tree transformations— a comparison
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized sequential machine maps
• Weighted tree automata and tree transducers
• Mappings and grammars on trees
• Statistical Machine Translation
• Morphismes et bimorphismes d'arbres
• Weighted extended tree transducers
• The Power of Extended Top-Down Tree Transducers
• Compositions of extended top-down tree transducers
• Tree series transformations that respect copying
• Title not available (Why is that?)
• Title not available (Why is that?)
• Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
• Compositions of tree series transformations
• Survey: Weighted extended top-down tree transducers. III. Composition
• The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
• Compositions with Constant Weighted Extended Tree Transducers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6154977)