Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition
From MaRDI portal
Publication:3098043
DOI10.1007/978-3-642-24897-9_13zbMath1230.68135OpenAlexW85070686MaRDI QIDQ3098043
Andreas Maletti, Aurélie Lagoutte
Publication date: 11 November 2011
Published in: Algebraic Foundations in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-24897-9_13
Formal languages and automata (68Q45) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items
Compositions of constant weighted extended tree transducers ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The rank of a formal tree power series
- Compositions of tree series transformations
- Compositions of extended top-down tree transducers
- Extended multi bottom-up tree transducers
- Weighted grammars and Kleene's theorem
- Recognizable formal power series on trees
- Morphismes et bimorphismes d'arbres
- On rational series and rational languages
- Tree series transformations that respect copying
- Hierarchies of tree series transformations
- Generalized sequential machine maps
- Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power
- Statistical Machine Translation
- Extended Multi Bottom-Up 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
- Composition of top-down and bottom-up tree transductions
- Term Rewriting and All That
- On the Determinization of Weighted Finite Automata
- Mappings and grammars on trees