Tree automata for code selection
Acta Informatica
Digital images and formal languages
Handbook of formal languages, vol. 3
The transducers and formal tree series
Acta Cybernetica
Information and Computation
Bottom-up and top-down tree series transformations
Journal of Automata, Languages and Combinatorics
Full Abstract Families of Tree Series I
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Finite-state transducers in language and speech processing
Computational Linguistics
Hierarchies of tree series transformations
Theoretical Computer Science
The power of tree series transducers of type i and II
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Code selection by tree series transducers
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Efficient inference through cascades of weighted tree transducers
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
Input products for weighted extended top-down tree transducers
DLT'10 Proceedings of the 14th international conference on Developments in language theory
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
| Hi-index | 5.23 |
Tree series transformations computed by bottom-up and top-down tree series transducers are called bottom-up and top-down tree series transformations, respectively. (Functional) compositions of such transformations are investigated. It turns out that the class of bottom-up tree series transformations over a commutative and complete semiring is closed under left-composition with linear bottom-up tree series transformations and right-composition with boolean deterministic bottom-up tree series transformations. Moreover, it is shown that the class of top-down tree series transformations over a commutative and complete semiring is closed under right-composition with linear, nondeleting top-down tree series transformations. Finally, the composition of a boolean, deterministic, total top-down tree series transformation with a linear top-down tree series transformation is shown to be a top-down tree series transformation.