Composition and evaluation of attribute coupled grammars
Acta Informatica
Handbook of formal languages, vol. 3
Macro tree transducers, attribute grammars, and MSO definable tree translations
Information and Computation
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Syntax-Directed Semantics: Formal Models Based on Tree Transducers
Benefits of Tree Transducers for Optimizing Functional Programs
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Proprietes de Cloture d'une Extension de Transducteurs d'Arbres Deterministes
CAAP '81 Proceedings of the 6th Colloquium on Trees in Algebra and Programming
Mathematical and computational aspects of lexicalized grammars
Mathematical and computational aspects of lexicalized grammars
A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Linear deterministic multi bottom-up tree transducers
Theoretical Computer Science
Relabeling syntax trees to improve syntax-based machine translation quality
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Tree acceptors and some of their applications
Journal of Computer and System Sciences
Generalized2 sequential machine maps
Journal of Computer and System Sciences
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Extended Multi Bottom-Up Tree Transducers
DLT '08 Proceedings of the 12th international conference on Developments in Language Theory
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
Efficient inference through cascades of weighted tree transducers
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A tree transducer model for synchronous tree-adjoining grammars
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
A decoder for probabilistic synchronous tree insertion grammars
ATANLP '10 Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing
Compositions of top-down tree transducers with ε-rules
FSMNLP'09 Proceedings of the 8th international conference on Finite-state methods and natural language processing
Equational tree transformations
Theoretical Computer Science
Tree transformations and dependencies
MOL'11 Proceedings of the 12th biennial conference on The mathematics of language
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
Survey: weighted extended top-down tree transducers part iii - composition
Algebraic Foundations in Computer Science
Weighted Extended Tree Transducers
Fundamenta Informaticae
Survey: Weighted Extended Top-down Tree Transducers Part II—Application in Machine Translation
Fundamenta Informaticae - Non-Classical Models of Automata and Applications II
Unidirectional derivation semantics for synchronous tree-adjoining grammars
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
Every sensible extended top-down tree transducer is a multi bottom-up tree transducer
NAACL HLT '12 Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies
| Hi-index | 0.00 |
Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular look-ahead can be implemented by a linear multi bottom-up tree transducer. The class of transformations computed by the latter device is shown to be closed under composition, and to be included in the composition of the class of transformations computed by top-down tree transducers with itself. More precisely, it constitutes the composition closure of the class of transformations computed by finite-copying top-down tree transducers.