2013

• M. Büchse, A. Koller, H. Vogler. General binarization for parsing and translation. Proc. of 51st Annual Meeting of the Association for Computational Linguistics, accepted for publication, 2013.
• M. Droste, H. Vogler. The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. Proc. 17th Int. Conf. on Developments in Language Theory (DLT 2013) 18th--21st of June 2013, Paris-Est, France. accepted for publication. long version: arXiv:1208.3942v1

2012

• J. Osterholzer, T. Stüber. State-Split for Hypergraphs with an Application to Tree Adjoining Grammars. Proc. of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11), pp. 180-188, Paris, 26-28 September 2012.
• M.-J. Nederhof, H. Vogler. Synchronous Context-Free Tree Grammars. Proc. of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11), pp. 55-63, Paris, 26-28 September 2012.
• Z. Fülöp, H. Vogler. Forward and Backward Application of Symbolic Tree Transducers. arXiv:1208.5324v1
• Z. Fülöp, H. Vogler. Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics. arXiv:1208.5317v1
• M. Büchse, A. Maletti and H. Vogler. Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars, 16th International Conference on Developments in Language Theory (DLT 2012), 2012.
• T. Stüber. Consistency of Probabilistic Context-Free Grammars, Dresden, Germany, Technical Report TUD-FI12-04-März 2012, Technische Universität Dresden, March 2012.
• M. Büchse, M.-J. Nederhof, H. Vogler. Tree Parsing for Tree-Adjoining Machine Translation, Journal of Logic and Computation, 2012; doi: 10.1093/logcom/exs050.
• M. Büchse and A. Fischer. Deciding the Twins Property for Weighted Tree Automata over Extremal Semifields. In Proceedings EACL 2012 Workshop on Applications of Tree Automata Techniques in Natural Language Processing (ATANLP 2012).
• M. Droste and H. Vogler. Weighted Automata and Multi-Valued Logics over Arbitrary Bounded Lattices. Theoretical Computer Science 418 (2012) 14-36.
• Z. Fülöp, T. Stüber, H. Vogler. A Büchi-like theorem for weighted tree automata over multioperator monoids. Theory of Computing Systems, 50(2), 241-278, 2012; published online: 28 October 2010.

2011

• M. Droste and H. Vogler (eds.). Selected Papers of the Workshop Weighted Automata: Theory and Applications, 2010, in: Acta Cybernetica 20(2), 2011.
• M. Büchse, M.-J. Nederhof, H. Vogler. Tree Parsing with Synchronous Tree-Adjoining Grammars, Proc. 12th Int. Conf. on Parsing Technologies (IWPT 2011) October 2011, Dublin, Ireland, Association for Computational Linguistics, pages 14-25.
• Z. Fülöp, A. Maletti, and H. Vogler. Weighted extended tree transducers, Fundamenta Informaticae 111(2): 163--202.
• M. Droste and H. Vogler. Weighted logics for unranked tree automata. Theory of Computing Systems, 48(1), 23–47, 2011. (published online first, 2009. doi:10.1007/s00224-009-9224-4)

2010

• D. Geisler, T. Stüber. Weighted Monadic Datalog Tree Transducers, Dresden, Germany, Technical Report TUD-FI10-07-Dezember 2010, Technische Universität Dresden, December 2010.
• M. Ćirić, M. Droste, J. Ignjatović, H. Vogler. Determinization of weighted finite automata over strong bimonoids, Information Sciences 180(18), 3497–3520, 2010.
• M. Büchse, J. May, H. Vogler. Determinization of weighted tree automata using factorizations. Journal of Automata, Languages and Combinatorics, 15 (2010) 3/4. (extended version of [BMV09]).
• M. Droste and H. Vogler. Kleene and Büchi Theorems for Weighted Automata and Multi-Valued Logics over Arbitrary Bounded Lattices. in: Y. Gao et al. (Eds.): DLT 2010, LNCS 6224, pp. 160–172, Springer-Verlag Berlin Heidelberg 2010.
• A. Maletti and H. Vogler. Compositions of Top-down Tree Transducers with Epsilon-rules. in: A. Yli-Jyrä et al. (eds.), Finite-State Methods and Natural Language Processing - FSMNLP 2009, LNAI 6062, pp. 69–80, Springer-Verlag, 2010.
• Z. Fülöp, A. Maletti and H. Vogler. Preservation of Recognizability for Synchronous Tree Substitution Grammars, Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, ACL 2010, p. 1–9, Uppsala, Sweden, 16 July 2010.
• M. Büchse, D. Geisler, T. Stüber and H. Vogler. n-Best Parsing Revisited, Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, ACL 2010, p. 46–54, Uppsala, Sweden, 16 July 2010.
• S. DeNeefe, K. Knight and H. Vogler. A Decoder for Probabilistic Synchronous Tree Insertion Grammars, Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing, ACL 2010, p. 10–18, Uppsala, Sweden, 16 July 2010.
• M. Droste, T. Stüber, and H. Vogler. Weighted finite automata over strong bimonoids. Information Sciences 180(1), 156–166, 2010.
• J. May, K. Knight, H. Vogler. Efficient Inference Through Cascades of Weighted Tree Transducers. In: Proc. of 48th Annual Meeting of the Association for Computational Linguistics, pp. 1058–1066, 2010.

2009

• M. Droste and H. Vogler (eds.): Selected Papers of the Workshop Weighted Automata: Theory and Applications, 2008, in: Acta Cybernetica 19(2), 2009.
• D. Seidel and J. Voigtländer. Taming Selective Strictness. In 4. Arbeitstagung Programmiersprachen - ATPS'09, im Rahmen der GI-Jahrestagung Informatik 2009, Lübeck, Germany, accepted.
• J. Voigtländer. Free Theorems Involving Type Constructor Classes. In 14th International Conference on Functional Programming - ICFP'09, Edinburgh, Scotland, Proceedings, ACM Press, accepted.
• P. Johann and J. Voigtländer. A Family of Syntactic Logical Relations for the Semantics of Haskell-like Languages. Information and Computation, volume 207(2), pages 341-368, 2009. [JV09]
  The definitive version of this work is available from http://dx.doi.org/10.1016/j.ic.2007.11.009.
• M. Büchse, J. May, and H. Vogler. Determinization of weighted tree automata using factorizations. in: Finite-State Methods and Natural Language Processing - FSMNLP 2009, 8th International Workshop, 2009.
• Z. Fülöp, A. Maletti, and H. Vogler. A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. Theory of Computing Systems 44(3), 455-499, 2009.
• F. Stenger and J. Voigtländer. Parametricity for Haskell with Imprecise Error Semantics. In Ninth International Conference on Typed Lambda Calculi and Applications - TLCA'09, Brasilia, Brazil, Proceedings, volume 5608 of LNCS, pages 294-308, © Springer-Verlag, July 2009.
• J. Voigtländer. Bidirectionalization for Free! In 36th Symposium on Principles of Programming Languages - POPL'09, Savannah, Georgia, Proceedings, pages 165-176, ACM Press, January 2009. [Voi09a]
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1480881.1480904).
• T. Stüber, H. Vogler, and Z. Fülöp. Decomposition of Weighted Multioperator Tree Automata. Int. J. Foundations of Computer Sci., 20(2):221-245, 2009.
• M. Büchse and T. Stüber. Monadic Datalog Tree Transducers. In A. H. Dediu, A.-M. Ionescu, and C. Martín-Vide, editors, LATA, volume 5457 of Lecture Notes in Computer Science, pages 267-278. Springer, 2009.
• Z. Fülöp, H. Vogler. Weighted tree automata and tree transducers. in: M. Droste, W. Kuich, H. Vogler (eds.), Handbook of Weighted Automata, Chapter 9, Springer, 2009.
• M. Droste, W. Kuich, and H. Vogler (eds.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science, © Springer, 2009.
• J. Högberg, A. Maletti, H. Vogler. Bisimulation Minimisation of Weighted Automata on Unranked Trees. Fundamenta Informaticae, 92(1-2), 103-130, 2009.
• D. Radovanovic. Weighted Tree Automata over Strong Bimonoids. Dresden, Germany, Technical Report TUD-FI09-02, Dresden University of Technology, February 2009, accepted for publication in Novi Sad Journal of Mathematics.

2008

• F. Stenger and J. Voigtländer. Parametricity for Haskell with Imprecise Error Semantics. Dresden, Germany, Technical Report TUD-FI08-08, Dresden University of Technology, 2008.
• T. Stüber and H. Vogler. Weighted monadic datalog. Theoretical Computer Science 403 (2008), pages 221-238.
• J. Voigtländer. Asymptotic Improvement of Computations over Free Monads. In 9th International Conference on Mathematics of Program Construction - MPC'08, Marseille, France, Proceedings, volume 5133 of LNCS, pages 388-403, © Springer-Verlag, July 2008.
• B. Seselja, A. Tepavcevic, H. Vogler. A note on cut-worthyness of recognizable tree series. Fuzzy Sets and Systems 159 (2008), 3087-3090.
• J. Högberg, A. Maletti, H. Vogler. Bisimulation minimisation of weighted automata on unranked trees. Technical Report, TUD-FI08-03 - March 2008.
• M. Droste, J. Sakarovitch, H. Vogler. Weighted Automata with Discounting. Information Processing Letters 108 (2008), pages 23-28.
• J. Voigtländer. Semantics and Pragmatics of New Shortcut Fusion Rules. In 9th International Symposium on Functional and Logic Programming - FLOPS'08, Ise, Japan, Proceedings, volume 4989 of LNCS, pages 163-179, © Springer-Verlag, April 2008.
• J. Voigtländer. Much Ado about Two: A Pearl on Parallel Prefix Computation. In 35th Symposium on Principles of Programming Languages - POPL'08, San Francisco, California, Proceedings, volume 43(1) of SIGPLAN Notices, pages 29-35, ACM Press, January 2008. [Voi08b]
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1328438.1328445).
• J. Voigtländer. Proving Correctness via Free Theorems: The Case of the destroy/build-Rule. In Symposium on Partial Evaluation and Semantics-Based Program Manipulation - PEPM'08, San Francisco, California, Proceedings, pages 13-20, ACM Press, January 2008. [Voi08a]
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/1328408.1328412).

2007

• F. Drewes and H. Vogler. Learning Deterministically Recognizable Tree Series. J. Automata, Languages and Combinatorics, 12, 333-354, 2007.
• M. Droste and H. Vogler (eds.): Selected Papers of the Workshop Weighted Automata: Theory and Applications, Journal of Autommata, Languages and Combinatorics 12(4), 2007.
• J. Voigtländer. Formal Efficiency Analysis for Tree Transducer Composition. Theory of Computing Systems 41(4), 619-689, 2007. [Voi07]
  The original publication is available from http://dx.doi.org/10.1007/s00224-006-1235-9.
• J. Voigtländer and P. Johann. Selective strictness and parametricity in structural operational semantics, inequationally. Theoretical Computer Science 388(1-3), 290-318, 2007.
• J. Giesl, A. Kühnemann, and J. Voigtländer. Deaccumulation Techniques for Improving Provability. Journal of Logic and Algebraic Programming 71(2), 79-113, 2007.
• J. Högberg, A. Maletti, and J. May. Backward and forward bisimulation minimisation of tree automata. Proc. 12th Int. Conf. Implementation and Application of Automata, LNCS 4783, 109-121, © Springer-Verlag, 2007.
• J. Högberg, A. Maletti, and J. May. Backward and Forward Bisimulation Minimisation of Tree Automata. Technical Report ISI-TR-633, Information Sciences Institute, University of Southern California, 2007.
• J. Högberg, A. Maletti, and J. May. Bisimulation Minimisation of Weighted Tree Automata. Technical Report ISI-TR-634, Information Sciences Institute, University of Southern California, 2007.
• A. Maletti. Learning deterministically recognizable tree series revisited. Proc. 2nd Int. Conf. Algebraic Informatics, LNCS 4728, 218-235, © Springer-Verlag, 2007.
• A. Maletti. Myhill-Nerode theorem for recognizable tree series revisited. Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications. 2007.
• J. Högberg, A. Maletti, and J. May. Bisimulation minimisation for weighted tree automata. Proc. 11th Int. Conf. Developments in Language Theory, LNCS 4588, 229-241, © Springer-Verlag, 2007.
• A. Maletti. Pure and O-Substitution. Int. J. Found. Comput. Sci. 18(4), 829-845, © World Scientific Publishing Company. 2007.
• A. Maletti. Compositions of extended top-down tree transducers. Proc. 1st Int. Conf. Language and Automata Theory and Applications. Report 35/07, pages 379-390. Universitat Rovira I Virgili, 2007.

2006

• Z. Fülöp and H. Vogler. A Comparison of Several Models of Weighted Tree Automata. Dresden, Germany, Technical Report TUD-FI06-08-Dez.2006, Dresden University of Technology.
• A. Maletti. Pure and O-Substitution. Dresden, Germany, Technical Report TUD-FI06-05 - 2006, Dresden University of Technology.
• M. Droste and H. Vogler. Weighted tree automata and weighted logics. Theoretical Computer Science 366 (2006), 228-247.
• M. Droste and H. Vogler. Weighted logics for XML, manuscript, 2006.
• J. Voigtländer and P. Johann. Selective Strictness and Parametricity in Structural Operational Semantics. Technical Report TUD-FI06-02, Dresden University of Technology, 2006. [VJ06] (revised version to appear in Theoretical Computer Science, see [VJ07])
• A. Maletti. Does o-Substitution Preserve Recognizability. Proc. 11th Int. Conf. Implementation and Application of Automata, LNCS 4094, 150-161, © Springer-Verlag, 2006.
• B. Borchardt, A. Maletti, B. Seselja, A. Tepavcevic, and H. Vogler. Cut sets as Recognizable Tree Languages. Fuzzy Sets and Systems 157(11), 1560-1571, 2006.
• A. Kühnemann and A. Maletti. The substitution vanishes. Proc. 11th Int. Conf. Algebraic Methodology and Software Technology, LNCS 4019, 173-188, Springer-Verlag, 2006.
• A. Maletti. Compositions of Tree Series Transformations. Theoretical Computer Science, 366(3), 248-271, 2006.
• A. Maletti. Hierarchies of Tree Series Transformations Revisited. Proc. 10th Int. Conf. Developments in Language Theory, LNCS 4036, 215-225, Springer-Verlag, 2006.
• P. Johann and J. Voigtländer. The Impact of seq on Free Theorems-Based Program Transformations. Fundamenta Informaticae 69(1-2), 63-102, 2006.

2005

• J. Giesl, A. Kühnemann, and J. Voigtländer. Deaccumulation Techniques for Improving Provability. Dresden, Germany, Technical Report TUD-FI05-14 - December 2005, Dresden University of Technology. [GKV05]
  (accepted to Journal of Logic and Algebraic Programming, see [GKV07])
• Z. Fülöp and L. Muzamel. Decomposition Results for Pebble Macro Tree Transducers. Dresden, Germany, Technical Report TUD-FI05-13 - December 2005, Dresden University of Technology.
• A. Maletti. Compositions of Tree Series Transformations. Dresden, Germany, Technical Report TUD-FI05-05 - October 2005, Dresden University of Technology.
• A. Maletti and H. Vogler. Incomparability Results for Classes of Polynomial Tree Series Transformations. Journal of Automata, Languages and Combinatorics, 10(4), 535-568, 2005.
• Z. Fülöp, A. Kühnemann, and H. Vogler. Linear Deterministic Multi Bottom-up Tree Transducers. Theoretical Computer Science 347(1-2), 276-287.
• M. Droste and H. Vogler (eds.): Selected Papers of the Workshop Weighted Automata: Theory and Applications, Journal of Autommata, Languages and Combinatorics 10(2-3), 2005.
• J. Voigtländer. Tree Transducer Composition as Program Transformation. PhD thesis. Dresden University of Technology, 2005.
• A. Maletti. HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Theoretical Computer Science, 339(2-3), 200-240, 2005.
• A. Maletti. Relating tree series transducers and weighted tree automata. International Journal of Foundations of Computer Science 16(4), 723 - 741, 2005.
• A. Maletti. Compositions of bottom-up tree series transformations. Proc. 11th Int. Conf. Automata and Formal Languages, University of Szeged, 187-199, 2005.
• A. Maletti. The Power of Tree Series Transducers of Type I and II. Proc. 9th Int. Conf. Developments in Language Theory, LNCS 3572, 338-349, Springer-Verlag, 2005.
• M. Droste, C. Pech, and H. Vogler. A Kleene Theorem for Weighted Tree Automata. Theory of Computing Systems 38 (1), 1-38, 2005.
• B. Borchardt. Code Selection by Tree Series Transducers. Proc. of 9th Int. Conf. Implementation and Application of Automata, Kingston, Canada, Springer Lecture Notes in Computer Science 3317, 57 - 67, 2005.
• B. Borchardt, Z. Fülöp, Z. Gazdag, and A. Maletti Bounds for Tree Automata with Polynomial Costs. Journal of Automata, Languages and Combinatorics 10(2-3), 107-157, 2005.

2004

• A. Maletti. Myhill-Nerode theorem for sequential transducers over unique GCD-monoids. Proc. 9th Int. Conf. Implementation and Application of Automata, LNCS 3317, 323-324, Springer-Verlag, 2004
• A. Maletti. Relating tree series transducers and weighted tree automata. Proc. of 8th Int. Conf. Developments in Language Theory, LNCS 3340, 321-333, Springer, 2004
• B. Borchardt. The Theory of Recognizable Tree Series. PhD thesis. Dresden University of Technology, 2004.
• Z. Fülöp and H. Vogler. Weighted tree transducers. Journal of Automata, Languages and Combinatorics 9, 31-54, 2004.
• R. Pöschel, A. Semigrodskikh, and H. Vogler. On clones of tree functions closed under primitive recursion, Acta Cybernetica 16 (3), 411-425, 2004.
• Z. Fülöp, A. Kühnemann, and H. Vogler. A Bottom-up Characterization of Deterministic Top-down Tree Transducers with Regular Look-Ahead, Information Processing Letters 91 (2004), 57-67.
• Z. Fülöp, Zs. Gazdag, and H. Vogler. Hierarchies of Tree Series Transformations, Theoretical Computer Science 314 (2004), 387-429.
• J. Voigtländer. Formal Efficiency Analysis for Tree Transducer Composition. Dresden, Germany, Technical Report TUD-FI04-08 - June 2004, Dresden University of Technology. [Voi04b]
  (abridged and revised version accepted to Theory of Computing Systems, see [Voi07])
• H. Vogler. φ-Recognizable Formal Power Series are φ-Rational - An Alternative Proof. Dresden, Germany, Technical Report TUD-FI04-06 - May 2004, Dresden University of Technology.
• A. Maletti. Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations. Dresden, Germany, Technical Report TUD-FI04-07 - May 2004, Dresden University of Technology.
• B. Borchardt. A Pumping Lemma and Decidability Problems for Recognizable Tree Series. Acta Cybernetica 16 (2004) 4, 509 - 544, 2004.
• C. Jürgensen and H. Vogler. Syntactic composition of top-down tree transducers is short cut fusion. Mathematical Structures in Computer Science 14(2):215-282, 2004.
• J. Voigtländer. Using Circular Programs to Deforest in Accumulating Parameters. Higher-Order and Symbolic Computation 17(1-2): 129-163, Kluwer Academic Publishers 2004. [Voi04a]
  The definitive version of this work is available from http://dx.doi.org/10.1023/B:LISP.0000029450.36668.cb).
• J. Voigtländer and A. Kühnemann. Composition of functions with accumulating parameters. ( proof appendix )
  Journal of Functional Programming 14(3): 317-363, 2004.
• P. Johann and J. Voigtländer. Free Theorems in the Presence of seq. In Neil D. Jones and Xavier Leroy (Editors), 31st Symposium on Principles of Programming Languages - POPL'04, Venice, Italy, Proceedings, volume 39(1) of SIGPLAN Notices, pages 99-110, ACM Press, January 2004. [JV04a]
  (extended version to appear in Fundamenta Informaticae, see [JV06])
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/964001.964010).

2003

• J. Giesl, A. Kühnemann, and J. Voigtländer. Deaccumulation - Improving Provability. In Vijay A. Saraswat (Editor), Eighth Asian Computing Science Conference - ASIAN'03, Mumbai, India, Proceedings, volume 2896 of LNCS, pages 146-160, Springer-Verlag, December 2003.
• B. Borchardt and H. Vogler. Determinization of Finite State Weighted Tree Automata. Journal of Automata, Languages and Combinatorics 8 (2003) 3, 417 - 463.
• B. Borchardt. The Myhill-Nerode Theorem for Recognizable Tree Series. Proc. of 7th Int. Conf. Development in Language Theory, Springer-Verlag Lect. Notes in Computer Science 2710, 146-158, 2003.
• M. Droste and H. Vogler (eds.). Selected Papers of the Workshop Weighted Automata: Theory and Applications (Dresden University of Technology, Germany, March 4-8, 2002). Journal of Automata, Languages and Combinatorics 8, 2003.
• Z. Fülöp and H. Vogler. Tree Series Transformations that Respect Copying. Theory of Comput. Systems 36(3): 247-293, 2003.

2002

• A. Maletti. Direct Construction and Efficiency Analysis for the Accumulation Technique of 2-Modular Tree Transducers. Diplomarbeit, TU Dresden, November 2002.
• J. Voigtländer. Concatenate, Reverse and Map Vanish For Free. In S. Peyton Jones and M. Wand (Editors), Seventh ACM SIGPLAN International Conference on Functional Programming - ICFP'02, Pittsburgh, Pennsylvania, Proceedings, volume 37(9) of SIGPLAN Notices, pages 14-25, ACM Press, October 2002. [Voi02c]
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/581478.581481).
• J. Voigtländer. Using Circular Programs to Deforest in Accumulating Parameters. In K. Asai and W.-N. Chin (Editors), ACM SIGPLAN Asian Symposium on Partial Evaluation and Semantics-Based Program Manipulation - ASIA-PEPM'02, Aizu, Japan, Proceedings, pages 126-137, ACM Press, September 2002. [Voi02b]
  (extended version appeared in Higher-Order and Symbolic Computation, see [Voi04a])
  This (author's) version of the work is posted here by permission of ACM for your personal use; not for redistribution. The definitive version was published as indicated (cf. also http://doi.acm.org/10.1145/568173.568187).
• J. Engelfriet, Z. Fülöp, and H. Vogler. Bottom-up and Top-down Tree Series Transformations. J. Automata, Languages, and Combinatorics 7 (2002), 11-70.
• J. Voigtländer. Conditions for Efficiency Improvement by Tree Transducer Composition. In S. Tison (Editor), 13th International Conference on Rewriting Techniques and Applications - RTA'02, Copenhagen, Denmark, Proceedings, volume 2378 of LNCS, pages 222-236, Springer-Verlag, July 2002.

2001

• A. Kühnemann. Attribute Grammars and Program Optimization. Summer Colloquium, Waseda University, Tokyo, Japan, July 25 - August 2, 2000, Organized by R. Glck and Y. Futamura, Technical Report, Institute for Software Production Technology, Waseda University, Tokyo, August 2001.
• J. Voigtländer and A. Kühnemann. Composition of Functions with Accumulating Parameters. Dresden, Germany, Technical Report TUD-FI01-08 - August 2001, Dresden University of Technology. [VK01]
  (revised version appeared in Journal of Functional Programming, see [VK04])
• A. Kühnemann and J. Voigtländer. Tree Transducer Composition as Deforestation Method for Functional Programs. Dresden, Germany, Technical Report TUD-FI01-07 - August 2001, Dresden University of Technology.
• A. Maletti. Efficiency Analysis for the Elimination of Intermediate Results in Functional Programs by Composition of Attributed Tree Transducers. Bakkalaureatsarbeit. Juli 2001.
• A. Kühnemann, R. Glück, and K. Kakehi.Relating accumulative and non-accumulative functional programs. In A. Middeldorp (Editor), 12th International Conference on Rewriting Techniques and Applications - RTA'01, Utrecht, The Netherlands, Proceedings, volume 2051 of LNCS, pages 154-168, Springer-Verlag, May 2001.
• J. Voigtländer. Composition of restricted Macro Tree Transducers. Master's Thesis, Dresden University of Technology, April 2001.
• Th. Noll and H. Vogler. The Universality of Higher-Order Attributed Tree Transducers. Theory of Computing Systems, 34 (1) 2001, 45-75.

2000

• C. Jürgensen. A Formalization of Hylomorphism Based Deforestation with an Application to an Extended Typed Lambda-Calculus. Dresden, Germany, Technical Report TUD-FI00-13 - November 2000, Dresden University of Technology.
• A. Kühnemann. Elimination of intermediate results in functional programs. In A. Poetzsch-Heffter and J. Meyer (Editors), Workshop "Programmiersprachen und Grundlagen der Programmierung", Kirchhundem-Heinsberg, Germany, September 1999, volume 263 - 1/2000 of Informatik Berichte, University of Hagen, Department of Computer Science, pages 105-112, 2000.
• J. Voigtländer. Description of Properties of Attributed Tree Transducers by means of (Monadic) Second-Order Logic. Großer Beleg, Technical University of Dresden, April 2000.
• E. Bormann. Entwurf und Implementierung eines Systems zur Erzeugung syntaxgesteuerter Editoren. Master's Thesis, Technical University of Dresden, Defence: May 5th, 2000.
• A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In R. Glück and Y. Futamura (Editors), International Colloquium "Partial Evaluation and Program Transformation", Waseda University, Tokyo, Japan, November 1999, Technical Report, Institute for Software Production Technology, Waseda University, Tokyo, pages 61-82, February 2000.

1999

• Z. Fülöp and H. Vogler. A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. Theory of Comput. Systems, 32:649-676, 1999.
• M. Höff. Vergleich von Verfahren zur Elimination von Zwischenergebnissen bei funktionalen Programmen. Master's Thesis. Dresden, Germany, Dresden University of Technology, Defence: October 27th, 1999.
• P. Hofstedt. A Functional Logic Language as Hostlanguage for a System of Combined Constraint Solvers. In Rachid Echahed (Ed.), Proceedings of the 8th International Workshop on Functional and Logic Programming. Rapport de Recherche RR 1021-I. Laboratoire LEIBNIZ - Institut IMAG. Grenoble. France. June 1999.
• D. Kirsten. A Connection between the Star Problem and the Finite Power Property in Trace Monoids. In P. van Emde Boas and M. Nielsen and J. Wiedermann (Eds.), Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, Proceedings, volume 1644 of LNCS, pages 473-482, Springer-Verlag, Berlin, 1999, ICALP'99 Best Student Paper Award.
• D. Kirsten. Some Undecidability Results related to the Star Problem in Trace Monoids. In C. Meinel and S. Tison (Eds.), 16th Symposium on Theoretical Aspects in Computer Science - STACS'99, Trier, Germany, Proceedings, volume 1563 of LNCS, pages 227 - 236, Springer-Verlag, 1999.
• D. Kirsten and J. Marcinkowski. Two Techniques in the Area of the Star Problem. In P. van Emde Boas and M. Nielsen and J. Wiedermann (Eds.), Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, Proceedings, volume 1644 of LNCS, pages 483-492, Springer-Verlag, Berlin, 1999.
• D. Kirsten and G. Richomme. Decidability Equivalence Between the Star Problem and the Finite Power Problem in Trace Monoids. Technical Report TUD-FI99-03, Dresden University of Technology.
• A. Kühnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In A. Middeldorp and T. Sato (Editors), 4th Fuji International Symposium on Functional and Logic Programming - FLOPS'99, Tsukuba, Japan, Proceedings, volume 1722 of LNCS, pages 114-130. Springer-Verlag, November 1999.
• A. Kühnemann. Comparison of deforestation techniques for functional programs and for tree transducers. In H. Vogler (Editor), International Workshop "Grammars, Automata, and Logic on Graphs and Trees", Dresden, Germany, Technical Report TUD-FI99-01, Dresden University of Technology, 1999.
• C. Lescher. Entwurf und Implementierung einer Eingabesprache für ein System zur Erzeugung syntaxgesteuerter Editoren. Grosser Beleg, Dresden University of Technology, 1999.
• H. Vogler (Editor). International Workshop on Grammars, Automata, and Logic on Graphs and Trees. Technical Report TUD-FI99-01 - March 1999, Dresden University of Technology.

1998

• I. Adamski, B. Jokubeit, A. Kühnemann, and H. Vogler. Incremental evaluators for macro attribute grammars. Technical Report TUD-FI98-10 - October 1998, Dresden University of Technology.
• J. Engelfriet and H. Vogler. The equivalence of bottom-up and top-down tree-to-graph transducers. Journal of Computer and System Science, 56:332-356, 1998.
• Z. Fülöp and H. Vogler. Syntax-Directed Semantics - Formal Models Based on Tree Transducers. Monographs on Theoretical Computer Science, An EATCS Series, Springer-Verlag, 1998.
• P. Hofstedt. An Architecture for the Combination of Constraint Solvers. In K. Apt, P. Codognet and E. Monfroy (Eds.), ERCIM/COMPULOG Workshop on Constraints, Amsterdam, Netherlands, Proceedings, 1998.
• P. Hofstedt. Combining Constraint Solvers by Projections. In H. Kuchen (Ed.), 7th International Workshop on Functional and Logic Programming, Proceedings , Arbeitsbericht Nr.63, Westfälische Wilhelms-Universität Münster, 1998.
• P. Hofstedt. Task Parallel Skeletons for Irregularly Structured Problems. In D.Pritchard and J.Reeve (Eds.), Euro-Par'98 - Parallel Processing, 4th International Euro-Par Conference, Southampton, UK , Proceedings, volume 1470 of LNCS, pages 676-681. Springer-Verlag. 1998.
• P. Hofstedt. An Architecture for the Combination of Constraint Solvers. Technical Report TUD-FI98-08 - August 1998, Dresden University of Technology.
• D. Kirsten. A Connection between the Star Problem and the Finite Power Property in Trace Monoids. Technical Report TUD-FI98-09 - October 1998, Dresden University of Technology.
• D. Kirsten. Some Undecidability Results related to the Star Problem in Trace Monoids. Technical Report TUD-FI98-07 - May 1998, Dresden University of Technology.
• A. Kühnemann. Benefits of tree transducers for optimizing functional programs. In V. Arvind and R. Ramanujam (Eds.), Foundations of Software Technology & Theoretical Computer Science - FST & TCS'98, 18th International Conference, Chennai, India, Proceedings, volume 1530 of LNCS, pages 146 - 157, Springer-Verlag, December 1998.
• S. Maneth and H. Vogler. Attributed Context-Free Hypergraph Grammars. Journal of Automata, Languages, and Combinatorics, 3: 105-147, 1998.

1997

• P. Hofstedt. Taskparallele Skelette für irregulär strukturierte Probleme in deklarativen Sprachen. Aachener Informatik - Berichte AIB 97-7, RWTH Aachen, Fachgruppe Informatik.
• A. Kühnemann and H. Vogler. Attributgrammatiken. Verlag Vieweg, 1997.
• A. Kühnemann. A two-dimensional hierarchy for attributed tree transducers. In B.S. Chlebus and L. Czaja (Eds.), Fundamentals of Computation Theory - FCT'97, 11th International Symposium, Krakow, Poland, Proceedings, volume 1279 of LNCS, pages 281 - 292, Springer-Verlag, September 1997.
• E. Bormann. Effizienzanalyse für Transformationen von primitiv-rekursiven Programmschemata. Grosser Beleg, Technical University of Dresden, September 1997.
• A. Kühnemann. Berechnungsstärken von Teilklassen primitiv-rekursiver Programmschemata. PhD thesis. Dresden University of Technology , July 1997.
• M. Lohrey. Term Rewriting as Interaction Nets Plus Hyperedge Replacement. Manuscript, Dresden University of Technology, 1997.
• M. Lohrey. NP-completeness results concerning the transformation of logic programs into attribute grammars. Acta Cybernetica, Vol. 13, Nr. 3, 1998, pages 209-224.
• A. Mößle and H. Vogler. Benefits of Hypergraphs for Program Transformation. In M. Jarke, K.Pasedach, K.Pohl (Eds.), Proceedings Informatik'97 , Reihe Informatik aktuell, Springer-Verlag, 1997, S. 572-581.

1996

• H. Faßbender and S. Maneth. A Strict Border for the Decidability of E-Unification for Recursive Functions. Technical Report TUD-FI96-21 - 1996, Dresden University of Technology.
• H. Faßbender and S. Maneth. A Strict Border for the Decidability of E-Unification for Recursive Functions. In M. Hanus and M. RodrО©╫uez-Artalejo (Eds.), Algebraic and Logic Programming - ALP'96, 5th International Conference, Aachen, Germany, Proceedings, volume 1139 of LNCS, pages 194-208. Springer-Verlag, September 1996.
• H. Faßbender and A. Mössle and H. Vogler. Implementation of a deterministic partial E-unification algorithm for macro tree transducers. Journal of Functional and Logic Programming, The MIT Press, 1996, Number 2.
• B. Jokubeit. Konstruktion eines inkrementellen Auswerters für geordnete Makroattributgrammatiken. Diplomarbeit, Dresden University of Technology, December 1996.
• A. Kühnemann. A pumping lemma for output languages of macro tree transducers. In H. Kirchner, editor, Trees in Algebra and Programming - CAAP'96, 21st International Colloquium, LinkО©╫ing, Sweden , Proceedings, volume 1059 of LNCS , pages 44 - 58. Springer-Verlag, April 1996.
• S. Maneth. On the Generating Power of Deterministic Tree Transducers. Technical Report TUD-FI96-19 - 1996, Dresden University of Technology.
• H. Vogler (Editor). Arbeitstreffen über: Grundlagen, Spezifikation, Implementierung und Verifikation von Programmiersprachen. Technical Report TUD-FI96-06 - February 1996, Dresden University of Technology.

1995

• D. Ernst, F. Houdek, A. Mößle, E. Müller, and H. Vogler. Kleine Vortragsreihe mit Demonstrationen zu: NoName - Eine funktionale Programmiersprache und ihr syntaxgesteuerter Editor. Technical Report TUD-FI95-07 - 1995, Dresden University of Technology.
• A. Kühnemann. A pumping lemma for output languages of macro tree transducers. Technical Report TUD-FI95-08 - 1995, Dresden University of Technology.
• S. Maneth and H. Vogler. Calculi and Efficiency Measures for Narrowing Techniques. Technical Report TUD-FI95-13 - 1995, Dresden University of Technology.
• A. Mößle and H. Vogler. Efficient Call-by value Evaluation Strategy of Primitive Recursive Program Schemes. Technical Report TUD-FI95-19 - 1995, Dresden University of Technology.
• A. Mößle and H. Vogler. Efficient Call-by-Value Evaluation Strategy of Primitive Recursive Program Schemes. Proceedings of the Fuji International Workshop in Functional and Logic Programming, Fuji Susono, Japan, World Scientific Publishing Co. Pte Ltd., 1995.

1994

• J. Engelfriet and H. Vogler. The translation power of top-down tree-to-graph transducers. Journal of Computer and System Sciences, 49:258-305, 1994.
• H. Faßbender and H. Vogler. A universal unification algorithm based on unification-driven leftmost outermost narrowing. Acta Cybernetica, 11:139-167, 1994.
• A. Kühnemann and H. Vogler. Synthesized and inherited functions - a new computational model for syntax-directed semantics. Acta Informatica, 31:431-477, 1994.
• A. Kühnemann and H. Vogler. A pumping lemma for output languages of attributed tree transducers. Acta Cybernetica, 11:261-305, 1994.
• T. Noll and H. Vogler. Top-down parsing with simultaneous attribute evaluation. Fundamenta Informaticae, 20:285-332, 1994.

1993

• Z. Fülöp, F. Herrmann, S. Vagvölgyi, and H. Vogler. Tree transducers with external functions. Theoret. Comput. Sci., 108:185-236, 1993.

1992

• H. Faßbender and H. Vogler. An implementation of syntax directed functional programming on nested-stack machines. Formal Aspects of Computing, 4:341-375, 1992.

1991

• J. Engelfriet and H. Vogler. Modular tree transducers. Theoretical Computer Science, 78:267-304, 1991.
• H. Vogler. Functional description of the contextual analysis in block-structured programming languages: a case study of tree transducers. Science of Computer Programming, 16:251-275, 1991.

1988

• J. Engelfriet and H. Vogler. High level tree transducers and iterated pushdown tree transducers. Acta Informatica, 26:131-192, 1988.
• H. Vogler. The OI-hierarchy is closed under control. Information and Computation, 78:187-204, 1988.

1987

• J. Engelfriet and H. Vogler. Look-ahead on pushdowns. Inf. Computation, 73:245-279, 1987.
• H. Vogler. Basic tree transducers. J. Comput. System Sci., 34:87-128, 1987.

1986

• J. Engelfriet and H. Vogler. Pushdown machines for the macro tree transducer. Theoret. Comput. Sci., 42:251-368,1986.
• H. Vogler. Iterated linear control and iterated one-turn pushdowns. Math. Systems Theory, 19, 1986.

1985

• J. Engelfriet and H. Vogler. Macro tree transducers. J. Comput. System Sci., 31:71-146,1985.