scientific article; zbMATH DE number 3997186

From MaRDI portal
Publication:4723319





[For the entire collection see Zbl 0593.00024.] The two types of tree transformations considered here are obtained by applying the general notions of rotational and algebraic subsets of an algebra to the direct product of two term algebras of the same finite signature. These tree transformations resemble in many ways rational string transductions. For example, they can be defined by bimorphisms of certain natural types, they preserve the recognizability of tree langages, and their classes are closed under composition. Moreover, the string transductions defined by them are, respectively, exactly the rational and the algebraic transductions. However, there are also some important differences. For example, our transformations are always locally finite. We also briefly discuss some generalizations and a possible application.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4723319)