No label defined (Q4723319)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3997186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3997186 |
Statements
1986
0 references
rational sets
0 references
algebraic sets
0 references
recognizable tree languages
0 references
tree transformations
0 references
0.8631690144538879
0 references
0.8218246698379517
0 references
0.8111101984977722
0 references
[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.
0 references