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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Maletti, A. (2006). Hierarchies of tree series transformations revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4036 LNCS, pp. 215–225). Springer Verlag. https://doi.org/10.1007/11779148_20
Mendeley helps you to discover research relevant for your work.