Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
From MaRDI portal
Publication:2915545
DOI10.14232/ACTACYB.20.2.2011.2zbMATH Open1265.68303OpenAlexW2187582831MaRDI QIDQ2915545FDOQ2915545
Authors: Andreas Maletti
Publication date: 18 September 2012
Published in: Acta Cybernetica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.14232/actacyb.20.2.2011.2
Recommendations
Research exposition (monographs, survey articles) pertaining to computer science (68-02) Formal languages and automata (68Q45) Natural language processing (68T50)
Cited In (9)
- Compositions of constant weighted extended tree transducers
- Title not available (Why is that?)
- Compositions of Weighted Extended Tree Transducers — The Unambiguous Case
- Survey: Weighted extended top-down tree transducers. III. Composition
- The power of weighted regularity-preserving multi bottom-up tree transducers
- Weighted extended tree transducers
- The Power of Extended Top-Down Tree Transducers
- Equational weighted tree transformations
- Survey: Weighted extended top-down tree transducers. II. Application in machine translation
This page was built for publication: Survey: Weighted extended top-down tree transducers. I. Basics and expressive power
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915545)