Characterizing and deciding MSO-definability of macro tree transductions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1770, Issue , 2000, Pages 542-554

  Engelfriet, Joost ^a   Maneth, Sebastian ^a  

^a LEIDEN UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BACTERIOPHAGES; FORESTRY;

DEFINABILITY;

MACROS;

EID: 22844457290     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46541-3_45     Document Type: Conference Paper

References (14)

1. A. V. Aho and J. D. Ullman. Translations on a context-free grammar. Inform. and Control, 19:439-475, 1971.
2. R. Bloem and J. Engelfriet. A comparison of tree transductions defined by monadic second order logic and by attribute grammars. Technical Report 98-02, Leiden University, 1998. To appear in J. of Comp. Syst. Sci.
3. B. Courcelle and P. Franchi-Zannettacci. Attribute grammars and recursive program schemes. Theoret. Comput. Sci., 17:163-191 and 235-257, 1982.
4. B. Courcelle. Monadic second-order definable graph transductions: a survey. Theoret. Comput. Sci., 126:53-75, 1994.
5. B. Courcelle. Structural properties of context-free sets of graphs generated by vertex replacement. Inform. and Comput., 116:275-293, 1995.
6. F. Drewes and J. Engelfriet. Decidability of finiteness of ranges of tree transductions. Inform. and Comput., 145:1-50, 1998.
7. F. Drewes. The complexity of the exponential output size problem for topdown tree transducers. In G. Ciobanu and Gh. Pǎun, editors, Proc. FCT 99, volume 1684 of LNCS, pages 234-245. Springer-Verlag, 1999.
8. J. Engelfriet and S. Maneth. Macro tree transducers of linear size increase. In preparation, http://www.wi.leidenuniv.nl/~maneth/LSI.ps.gz.
9. J. Engelfriet and S. Maneth. Macro tree transducers, attribute grammars, and MSO definable tree translations. Inform. and Comput., 154:34-91, 1999.
10. J. Engelfriet, G. Rozenberg, and G. Slutzki. Tree transducers, L systems, and two-way machines. J. of Comp. Syst. Sci., 20:150-202, 1980.
11. J. Engelfriet and H. Vogler. Macro tree transducers. J. of Comp. Syst. Sci., 31:71-146, 1985.
12. Z. Fülöp and H. Vogler. Syntax-Directed Semantics -Formal Models based on Tree Transducers. EATCS Monographs on Theoretical Computer Science (W. Brauer, G. Rozenberg, A. Salomaa, eds.). Springer-Verlag, 1998.
13. F. Gécseg and M. Steinby. Tree automata. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages. Vol. 3. Chap. 1. Springer-Verlag, 1997.
14. N. Klarlund and M. I. Schwartzbach. Graphs and decidable transductions based on edge constraints. In S. Tison, editor, Proc. CAAP 94, volume 787 of LNCS, pages 187-201. Springer-Verlag, 1994.