Decidability of the Finiteness of Ranges of Tree Transductions

Information and Computation

Volumn 145, Issue 1, 1998, Pages 1-50

  Drewes, Frank ^a   Engelfriet, Joost ^b  

^a UNIVERSITY OF BREMEN   (Germany)

^b LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0009225255     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1998.2715     Document Type: Article

References (53)

1. André, Y., and Dauchet, M. (1987), Decidability of equivalence for a class of non-deterministic tree transducers, RAIRO Inform. Théor. Appl. 28, 447-463.
2. Aho, A. V., and Ullman, J. D. (1971), Translations on a context free grammar, Inform. and Control 19, 439-475.
3. Baker, B. S. (1978), Generalized syntax directed translation, tree transducers, and linear space, SIAM J. Comput. 7, 376-391.
4. Baker, B. S. (1978), Tree transducers and tree languages, Inform. and Control 37, 241-266.
5. Baker, B. S. (1979), Composition of top-down and bottom-up tree transductions, Inform. and Control 41, 186-213.
6. Büchi, R. J. (1966), Algebraic theory of feedback in discrete systems, in "Automata Theory" (E. R. Caianello, Ed.), Part I, pp. 70-101, Academic Press, New York.
7. Courcelle, B., and Franchi-Zannettacci, P. (1982), Attribute grammars and recursive program schemes I, II, Theor. Comput. Sci. 17, 163-191; 235-257.
8. Courcelle, B., and Mosbah, B. (1993), Monadic second order evaluations on tree-decomposable graphs, Theor. Comput. Sci. 109, 49-82.
9. Damm, W. (1982), The IO- and OI-hierarchies, Theor. Comput. Sci. 20, 95-208.
10. Dányi, G., and Fülöp, Z. (1996), Superlinear deterministic top-down tree transducers, Math. Systems Theory 29, 507-534.
11. Damm, W., and Goerdt, A. (1986), An automata-theoretical characterization of the OI-hierarchy, Inform. and Control 71, 1-32.
12. Drewes, F. (1996), "Computation by Tree Transductions," Doctoral dissertation, University of Bremen, Germany.
13. Drewes, F. (1996), Language theoretic and algorithmic properties of d-dimensional collages and patterns in a grid, J. Comput. System Sci. 53, 33-60.
14. Drewes, F. (1996), A lower bound on the growth of functions computed by tree transducers, Fund. Inform. 26, 267-286. [Short version in Lecture Notes in Computer Science, Vol. 787 (CAAP 94), Springer-Verlag, Berlin.]
15. Drewes, F. (1996), A lower bound on the growth of functions computed by tree transducers, Fund. Inform. 26, 267-286. [Short version in Lecture Notes in Computer Science, Vol. 787 (CAAP 94), Springer-Verlag, Berlin.]
16. Engelfriet, J. (1975), Bottom-up and top-down tree transformations - a comparison, Math. Systems Theory 9(3), 198-231.
17. Engelfriet, J. (1975), "Tree automata and tree grammars", Lecture Notes DAIMI FN-10, University of Aarhus.
18. Engelfriet, J. (1977), Top-down tree transducers with regular look-ahead, Math. Systems Theory 10, 289-303.
19. Engelfriet, J. (1978), On tree transducers for partial functions, Inform. Process. Lett. 7, 170-172.
20. Engelfriet, J. (1980), Some open questions and recent results on tree transducers and tree languages, in "Formal Language Theory: Perspectives and Open Problems" (R. V. Book, Ed.), pp. 241-286, Academic Press, New York.
21. Engelfriet, J. (1982), Three hierarchies of transducers, Math. Systems Theory 15, 95-125.
22. Engelfriet, J. (1991), Iterated stack automata and complexity classes, Inform. and Comput. 95, 21-75.
23. Engelfriet, J. (1994), Graph grammars and tree transducers, in "Proc. CAAP 94" (S. Tison, Ed.), Lecture Notes in Computer Science, Vol. 787, pp. 15-37, Springer-Verlag, Berlin.
24. Engelfriet, J., and Schmidt, E. M. (1977), IO and OI, I, J. Comput. System Sci. 15, 328-353.
25. Engelfriet, J., and Schmidt, E. M. (1978), IO and OI, II, J. Comput. System Sci. 16, 67-99.
26. Engelfriet, J., and Vogler, H. (1985), Macro tree transducers, J. Comput. System Sci. 31, 71-146.
27. Engelfriet, J., and Vogler, H. (1988), High level tree transducers and iterated pushdown tree transducers, Acta Inform. 26, 131-192.
28. Fischer, M. J. (1968), "Grammars with Macro-like Productions," Doctoral dissertation, Harvard University.
29. Fülöp, Z., and Vágvölgyi, S. (1989), Variants of top-down tree transducers with look-ahead, Math. Systems Theory 21, 125-145.
30. Gécseg, F., and Steinby, M. (1984), "Tree Automata," Akadémiai Kiadó, Budapest.
31. Gécseg, F., and Steinby, M. (1997), Tree languages, in "Handbook of Formal Languages" (G. Rozenberg and A. Salomaa, Eds.), Vol. III, Beyond Words, Chap. 1, pp. 1-68, Springer-Verlag, Berlin.
32. Gyenizse, P., and Vágvölgyi, S. (1996), Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations, Theor. Comput. Sci. 156, 71-97.
33. Habel, A. (1992), Hyperedge replacement: Grammars and languages, Lecture Notes in Computer Science, Vol. 643, Springer-Verlag, Berlin.
34. Hayashi, T. (1973), On derivation trees of indexed grammars - an extension of the uvwxy-theorem, Publ. Res. Inst. Math. Sci. 9, 61-92.
35. Habel, A., Kreowski, H.-J., and Vogler, W. (1991), Decidable boundedness problems for sets of graphs generated by hyperedge-replacement, Theor. Comput. Sci. 89, 33-62.
36. Hopcroft, J. E., and Ullman, J. D. (1979), "Introduction to Automata Theory, Languages and Computation," Addison-Wesley, Reading, MA.
37. Jones, N. D., and Skyum, S. (1979), Complexity of some problems concerning L systems, Math. Systems Theory 13, 29-43.
38. Maibaum, T. S. E. (1974), A generalized approach to formal languages, J. Comput. System Sci. 8, 409-502.
39. Mezei, J., and Wright, B. (1967), Algebraic automata and context-free sets, Inform, and Control 11, 3-29.
40. Rogers, H. (1987), "Theory of Recursive Functions and Effective Computability," MIT Press, Cambridge, MA.
41. Rounds, W. C. (1970), Mappings and grammars on trees, Math. Systems Theory 4, 257-287.
42. Rounds, W. C. (1970), Tree-oriented proofs of some theorems on context-free and indexed languages, in "Proc. Second Annual ACM Symposium on Theory of Computing (STOC)," pp. 109-116.
43. Salomaa, A. (1973), "Formal Languages," Academic Press, New York.
44. Seidl, H. (1994), Equivalence of finite-valued tree transducers is decidable, Math. Systems Theory 27, 285-346.
45. Seidl, H. (1994), Finite tree automata with cost functions, Theor. Comput. Sci. 126, 113-142.
46. Slutzki, G., and Vágvölgyi, S. (1995), Deterministic top-down tree transducers with iterated look-ahead, Theor. Comput. Sci. 143, 285-308.
47. 2 sequential machine maps, J. Comput. System Sci. 4, 339-367.
48. Thatcher, J. W. (1970), There's a lot more to finite automata theory than you would have thought, in "Proc. 4th Ann. Princeton Conf. on Information Sciences and Systems," pp. 263-276. [Revised version published as [Tha73]].
49. Thatcher, J. W. (1973), Tree automata: an informal survey, in "Currents in the Theory of Computing" (A. V. Aho, Ed.), pp. 143-172, Prentice Hall, New York.
50. Vogler, H. (1988), The IO-hierarchy is closed under control, Inform. and Comput. 78, 187-204.
51. Wand, M. (1973), "Mathematical Foundations of Formal Language Theory," Report MAC TR-108, Massachusetts Institute of Technology.
52. Wand, M. (1975), An algebraic formulation of the Chomsky hierarchy, in "Proc. Category Theory Applied to Computation and Control," Lecture Notes in Computer Science, Vol. 25, pp. 209-213, Springer-Verlag, Berlin.
53. Wanke, E. (1994), On the decidability of certain integer subgraph problems on context-free graph languages, Inform. and Comput. 113, 26-49.