A lower bound on the growth of functions computed by tree transducers

Fundamenta Informaticae

Volumn 26, Issue 3-4, 1996, Pages 267-285

  Drewes, Frank ^a  

^a UNIVERSITY OF BREMEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; COMPUTATIONAL METHODS; FUNCTIONS; NUMBER THEORY; TREES (MATHEMATICS);

BINARY REPRESENTATION; INJECTIVE FUNCTION; INPUT ALGEBRA; MONOTONIC OPERATIONS; SYMBOLIC COMPUTATION; TARGET ALGEBRA; TRANSDUCTION; TREE TRANSDUCERS;

COMPUTATION THEORY;

EID: 0030166248     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: 10.3233/fi-1996-263403     Document Type: Article

References (14)

1. B.S. Baker. Composition of top-down and bottom-up tree transductions. Information and Control 41, 186-213, 1979.
2. B. Courcelle, M. Mosbah. Monadic second order evaluations on tree-decomposable graphs. Theoretical Computer Science 109, 49-82, 1993.
3. B. Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85, 12-75, 1990.
4. F. Drewes. Transducibility - symbolic computation by tree-transductions. Report 2/93, Univ. Bremen, 1993.
5. J. Engelfriet. Bottom-up and top-down tree transformations - a comparison. Mathematical Systems Theory 9(3), 198-231, 1975.
6. J. Engelfriet. Top-down tree transducers with regular look-ahead. Mathematical Systems Theory 10, 289-303, 1977.
7. J. Engelfriet. On tree transducers for partial functions. Information Processing Letters 7, 170-172, 1978.
8. J. Engelfriet. Some open questions and recent results on tree transducers and tree languages. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, 241-286. Academic Press, New York, 1980.
9. J. Engelfriet. Graph grammars and tree transducers. In Proc. CAAP 94, Lecture Notes in Computer Science 787, 15-37, 1994.
10. F. Gécseg, M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
11. A. Habel, H.-J. Kreowski, W. Vogler. Decidable boundedness problems for sets of graphs generated by hyperedge-replacement. Theoretical Computer Science 89, 33-62, 1991.
12. C.St.J.A. Nash-Williams. On well-quasi-ordering trees. In Proc. Cambridge Phil. Soc. 59, 833-835, 1963.
13. H. Seidl. Finite tree automata with cost functions. In J.-C. Raoult, editor, Proc. CAAP 92, Lecture Notes in Computer Science 581, 279-299, 1992.
14. E. Wanke. On the decidability of integer subgraph problems on context-free graph languages. In L. Budach, editor, Proc. Fundamentals of Computation Theory, Lecture Notes in Computer Science 529, 415-426, 1991.