Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
From MaRDI portal
Publication:6154977
Cites work
- scientific article; zbMATH DE number 1809721 (Why is no real title available?)
- scientific article; zbMATH DE number 1200800 (Why is no real title available?)
- scientific article; zbMATH DE number 1257742 (Why is no real title available?)
- scientific article; zbMATH DE number 1354999 (Why is no real title available?)
- scientific article; zbMATH DE number 1358710 (Why is no real title available?)
- Bottom-up and top-down tree transformations— a comparison
- Compositions of extended top-down tree transducers
- Compositions of tree series transformations
- Compositions with Constant Weighted Extended Tree Transducers
- Generalized sequential machine maps
- Mappings and grammars on trees
- Morphismes et bimorphismes d'arbres
- OpenFst: A General and Efficient Weighted Finite-State Transducer Library
- Statistical Machine Translation
- Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
- Survey: Weighted extended top-down tree transducers. III. Composition
- The Power of Extended Top-Down Tree Transducers
- The support of a recognizable series over a zero-sum free, commutative semiring is recognizable
- Tree series transformations that respect copying
- Weighted extended tree transducers
- Weighted tree automata and 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)
