The monadic second-order logic of graphs. I. recognizable sets of finite graphs
Information and Computation
Decidable boundedness problems for sets of graphs generated by hyperedge-replacement
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Monadic second-order evaluations on tree-decomposable graphs
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
On the Decidability of Integer Subgraph Problems on Context-Free Graph Languages
FCT '91 Proceedings of the 8th International Symposium on Fundamentals of Computation Theory
Graph Grammars and Tree Transducers
CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Finite Tree Automata with Cost Functions
CAAP '92 Proceedings of the 17th Colloquium on Trees in Algebra and Programming
| Hi-index | 0.00 |
Tree transducers may be used to perform symbolic computations. A function f from (the domain of) one algebra into (the domain of) another algebra is computed by a transduction that yields for every term representing an element a of the input algebra a term representing f(a) in the target algebra. We consider the case where the input algebra is a term algebra, the target algebra is given by the natural numbers with monotonic operations (and in particular maximum, addition, and multiplication), and f is injective. Such an injective function may be seen as a coding of terms as natural numbers. It is shown that codings computed by top-down tree transducers cannot compress totally balanced trees: The binary representation of f(t) has at least the size of t up to a constant factor.