Tree series transformations that respect copying

Theory of Computing Systems

Volumn 36, Issue 3, 2003, Pages 247-293

  Fülöp, Zoltán ^a   Vogler, Heiko ^b  

^a UNIVERSITY OF SZEGED   (Hungary)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

TREE SERIES TRANSDUCERS;

COMPUTATIONAL METHODS; FINITE AUTOMATA; MATHEMATICAL TRANSFORMATIONS; THEOREM PROVING;

SEQUENTIAL MACHINES;

EID: 0038607919     PISSN: 14324350     EISSN: 14330490     Source Type: Journal    
DOI: 10.1007/s00224-003-1072-z     Document Type: Article

References (43)

1. [AE] P. R. J. Asveld and J. Engelfriet. Extended linear macro grammars, iteration grammars, and register programs. Acta Inform., 11:259-285, 1979.
2. [Ba] B. S. Baker. Composition of top-down and bottom-up tree transductions. Inform. and Control, 41:186-213, 1979.
3. [BE] R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. J. Comput. System Sci., 61:1-50, 2000.
4. [BR] J. Berstel and Ch. Reutenauer. Rational Series and Their Languages. Volume 12 of EATCS Monographs. Springer-Verlag, Berlin, 1988.
5. +] H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
6. [Co1] B. Courcelle. The monadic second-order logic of graphs, V: on closing the gap between definability and recognizability. Theoret. Comput. Sci., 80:153-202, 1991.
7. [Co2] B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci., 126:53-75, 1994.
8. [Co3] B. Courcelle. The expression of graph properties and graph transformations in monadic second-order logic. In G. Rozenberg, editor, Handbook of Graph Grammars and Computing by Graph Transformation, volume 1, chapter 5. World Scientific, Singapore, 1997.
9. [DE] F. Drewes and J. Engelfriet. Decidability of the finiteness of ranges of tree transductions, Inform. and Comput., 145:1-50, 1998.
10. [DG] W. Damm and I. Guessarian. Combining T and level-N. In J. Gruska and M. Chytil, editors, Proceedings of MFCS '96, pages 262-270. Volume 118 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1981.
11. [EFV] J. Engelfriet, Z. Fülöp, and H. Vogler. Bottom-up and top-down tree series transformations. J. Automata Lang. Combin., 7:11-70, 2002.
12. [Ei] S. Eilenberg. Automata, Languages, and Machines, volume A. Academic Press, New York, 1974.
13. [EM] J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform, and Comput., 154:34-91, 1999.
14. [En1] J. Engelfriet. Bottom-up and top-down tree transformations - a comparison. Math. Systems Theory, 9(3): 198-231, 1975.
15. [En2] J. Engelfriet. Top-down tree transducers with regular look-ahead. Math. Systems Theory, 10:289-303, 1977.
16. [En3] J. Engelfriet. Three hierarchies of transducers. Math. Systems Theory, 15:95-125, 1982.
17. [En4] J. Engelfriet. A characterization of context-free NCE graph languages by monadic second-order logic on trees. In G. Rozenberg H. Ehrig, and H.-J. Kreowski, editors, Graph Grammars and Their Application to Computer Sciences, pages 311-327. Volume 532 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1991.
18. [És1] Z. Ésik. Decidability results concerning tree transducers, I. Acta Cybernet., 5:1-20, 1980.
19. [És2] Z. Ésik. Decidability results concerning tree transducers, II. Acta Cybernet., 6:303-314, 1983.
20. [És3] Z. Ésik. Personal communication, 2002.
21. [ESvL] J. Engelfriet, E. M. Schmidt, and J. v. Leeuwen. Stack machines and classes of nonnested macro languages. J. Assoc. Comput. Mach., 27(1):96-117, 1980.
22. [EV] J. Engelfriet and H. Vogler. Modular tree transducers. Theoret. Comput. Sci., 78:267-304, 1991.
23. [FHVV] Z. Fülöp, F. Herrmann, S. Vágvölgyi, and H. Vogler. Tree transducers with external functions. Theoret. Comput. Sci., 108:185-236, 1993.
24. [FV1] Z. Fülöp and S. Vàgvölgyi. Decidability of the inclusion in monoids generated by tree transformation classes. In M. Nivat and A. Podelski, editors, Tree Automata and Languages, pages 381-408. Elsevier Science, Amsterdam, 1992.
25. [FV2] Z. Fülöp and H. Vogler. Syntax-Directed Semantics - Formal Models Based on Tree Transducers. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1998.
26. [GS1] F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
27. [GS2] F. Gécseg and M. Steinby. Tree languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, chapter 1, pages 1-68. Springer-Verlag, Berlin, 1997.
28. [Gu] I. Guessarian. Pushdown tree automata. Math. Systems Theory, 16:237-263, 1983.
29. [HW] U. Hebisch and H. J. Weinert. Semirings - Algebraic Theory and Applications in Computer Science. World Scientific, Singapore, 1998.
30. [KS] W. Kuich and A. Salomaa. Semirings, Automata, Languages. EATCS Monographs on Theoretical Computer Science. Springer-Verlag, Berlin, 1986.
31. [Ku1] W. Kuich. Semirings and formal power series: their relevance to formal languages and automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 1, chapter 9, pages 609-677. Springer-Verlag, Berlin, 1997.
32. [Ku2] W. Kuich. Tree transducers and formal tree series. Acta Cybernet., 14:135-149, 1999.
33. [NV] T. Noll and H. Vogler. The universality of higher-order attributed tree transducers. Theory Comput. Systems, 34:45-75, 2001.
34. [Ro1] W. C. Rounds. Trees, Transducers and Transformations. Ph.D. thesis, Stanford University, 1968.
35. [Ro2] W. C. Rounds. Mappings and grammars on trees. Math. Systems Theory, 4:257-287, 1970.
36. [Sc] M. P. Schützenberger. On the definition of a family of automata. Inform. and Control, 4:245-270, 1961.
37. [Se1] H. Seidl. Deciding equivalence of finite tree automata. SIAM J. Comput., 19:424-437, 1990.
38. [Se2] H. Seidl. Single-valuedness of tree transducers is decidable in polynomial time. Theoret. Comput. Sci., 106:135-181, 1992.
39. [SG] K. M. Schimpf and J. H. Gallier. Tree pushdown automata. J. Comput. System Sci., 30:25-40, 1985.
40. [SS] A. Salomaa and M. Soittola. Automata-Theoretic Aspects of Formal Power Series. Texts and Monographs in Computer Science. Springer-Verlag, Berlin, 1978.
41. 2 sequential machine maps. J. Comput. System Sci., 4:339-367, 1970.
42. [Th2] J. W. Thatcher. Tree automata: an informal survey. In A. V. Aho, editor, Currents in the Theory of Computing, pages 143-172. Prentice-Hall, Englewood Cliffs, NJ, 1973.
43. [Vo] H. Vogler. Tree Transducers and Pushdown Machines. Ph.D. thesis, Twente University of Technology, 1986.