Theoretical Computer Science
Basic notions of universal algebra for language theory and graph grammars
Theoretical Computer Science
Handbook of formal languages, vol. 3
Derivation trees of ground term rewriting systems
Information and Computation
The Theory of Parsing, Translation, and Compiling
The Theory of Parsing, Translation, and Compiling
Compositions of extended top-down tree transducers
Information and Computation
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms -- Revisited
CAI '09 Proceedings of the 3rd International Conference on Algebraic Informatics
Defining syntax-directed translations by tree bimorphisms
Theoretical Computer Science
The Power of Extended Top-Down Tree Transducers
SIAM Journal on Computing
Syntax-directed translations and quasi-alphabetic tree bimorphisms
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Equational weighted tree transformations with discounting
Algebraic Foundations in Computer Science
| Hi-index | 5.23 |
We define an equational relation as the union of some components of the least solution of a system of equations of tree transformations in a pair of algebras. We focus on equational tree transformations which are equational relations obtained by considering the least solutions of such systems in pairs of term algebras. We characterize equational tree transformations in terms of tree transformations defined by different bimorphisms. To demonstrate the robustness of equational tree transformations, we give equational definitions of some well-known tree transformation classes for which bimorphism characterizations also exist. These are the class of alphabetic tree transformations, the class of linear and nondeleting extended top-down tree transformations, and the class of bottom-up tree transformations and its linear and linear and nondeleting subclasses. Finally, we prove that a relation is equational if and only if it is the morphic image of an equational tree transformation.