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
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the workshop weighted automata: Theory and applications (Dresden University of Technology (Germany), March 4-8, 2002)
Determinization of finite state weighted tree automata
Journal of Automata, Languages and Combinatorics
Hierarchies of tree series transformations
Theoretical Computer Science
A Kleene Theorem for Weighted Tree Automata
Theory of Computing Systems
The power of tree series transducers of type i and II
DLT'05 Proceedings of the 9th international conference on Developments in Language Theory
Tree-Series-to-Tree-Series Transformations
CIAA '08 Proceedings of the 13th international conference on Implementation and Applications of Automata
Weighted Extended Tree Transducers
Fundamenta Informaticae
| Hi-index | 0.00 |
Tree series transformations computed by polynomial top-down and bottom-up tree series transducers are considered. The hierarchy of tree series transformations obtained in [Fülöp, Gazdag, Vogler: Hierarchies of Tree Series Transformations. Theoret. Comput. Sci. 314(3), p. 387–429, 2004] for commutative izz-semirings (izz abbreviates idempotent, zero-sum and zero-divisor free) is generalized to arbitrary positive (i.e., zero-sum and zero-divisor free) commutative semirings. The latter class of semirings includes prominent examples such as the natural numbers semiring and the least common multiple semiring, which are not members of the former class.