Compositions with Constant Weighted Extended Tree Transducers
From MaRDI portal
Publication:6072400
DOI10.1142/s0129054122450010OpenAlexW4308616756MaRDI QIDQ6072400
Andreas Maletti, Malte Blattmann
Publication date: 13 October 2023
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054122450010
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compositions of constant weighted extended tree transducers
- Compositions of extended top-down tree transducers
- Morphismes et bimorphismes d'arbres
- Tree series transformations that respect copying
- Composition closure of linear weighted extended top-down tree transducers
- Generalized sequential machine maps
- The Supports of Weighted Unranked Tree Automata
- The Support of a Recognizable Series over a Zero-sum Free, Commutative Semiring is Recognizable
- Pushing for Weighted Tree Automata
- 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
- Top-down tree transducers with regular look-ahead
- Weighted Tree Automata and Tree Transducers
- Mappings and grammars on trees