Part of the Lecture Notes in Computer Science book series (LNCS, volume 1770)
Characterizing and Deciding MSO-Definability of Macro Tree Transductions
A macro tree transduction is MSO definable if and only if it is of linear size increase. Furthermore, it is decidable for a macro tree transduction whether or not it is MSO definable.
KeywordsInput Tree Tree Automaton Rank Zero Tree Transduction Attribute Grammar
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- [BE98]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. Google Scholar
- [Dre99]F. Drewes. The complexity of the exponential output size problem for top-down tree transducers. In G. Ciobanu and Gh. PĂun, editors, Proc. FCT 99, volume 1684 of LNCS, pages 234–245. Springer-Verlag, 1999.Google Scholar
- [EM]J. Engelfriet and S. Maneth. Macro tree transducers of linear size increase. In preparation, http://www.wi.leidenuniv.nl/~maneth/LSI.ps.gz.
- [FV98]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.Google Scholar
- [GS97]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.Google Scholar
© Springer-Verlag Berlin Heidelberg 2000