The Power of Extended Top-Down Tree Transducers
From MaRDI portal
Publication:3558008
DOI10.1137/070699160zbMath1200.68257OpenAlexW1988267965MaRDI QIDQ3558008
No author found.
Publication date: 29 April 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/68cba7b8473d4318ea12cf89a110135d7d0df25b
Related Items (23)
Compositions of constant weighted extended tree transducers ⋮ Decision Problems of Tree Transducers with Origin ⋮ Linking theorems for tree transducers ⋮ Tree Transformations and Dependencies ⋮ Decision problems of tree transducers with origin ⋮ Applications of Weighted Automata in Natural Language Processing ⋮ Compositions with Constant Weighted Extended Tree Transducers ⋮ Compositions of Weighted Extended Tree Transducers — The Unambiguous Case ⋮ Look-ahead removal for total deterministic top-down tree transducers ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Compositions of extended top-down tree transducers ⋮ Composition closure of linear extended top-down tree transducers ⋮ PROPERTIES OF QUASI-RELABELING TREE BIMORPHISMS ⋮ Equational tree transformations ⋮ The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers ⋮ Linear context-free tree languages and inverse homomorphisms ⋮ Bottom-up unranked tree-to-graph transducers for translation into semantic graphs ⋮ Determinacy and rewriting of functional top-down and MSO tree transformations ⋮ Extended symbolic finite automata and transducers ⋮ Compositions of Tree-to-Tree Statistical Machine Translation Models ⋮ Equational Weighted Tree Transformations with Discounting ⋮ Survey: Weighted Extended Top-Down Tree Transducers Part III — Composition ⋮ Extended multi bottom-up tree transducers
This page was built for publication: The Power of Extended Top-Down Tree Transducers
