TUD Logo

TUD Home » ... » Theoretical Computer Science » Chair of Foundations of Programming » Publications

Chair of Foundations of Programming

Publications

For advanced search options you can also view this in the Forschungsinformationssystem of the TU Dresden.

1 bis 185 von 185 Einträgen

Gebhardt, Kilian; Nederhof, Mark-Jan; Vogler, Heiko: Hybrid grammars for parsing of discontinuous phrase structures and non-projective dependency structures. In: Computational Linguistics, accepted for publication (2016)

Nederhof, Mark-Jan; Teichmann, Markus; Vogler, Heiko: Non-Self-Embedding Linear Context-Free Tree Grammars Generate Regular Tree Languages. In: Journal of Automata, Languages and Combinatorics 21 (2016), Nr. 3, S. 203–246

Dietze, Toni: Equivalences between Ranked and Unranked Weighted Tree Automata via Binarization. In: Proceesings of the ACL Workshop on Statistical Natural Language Processing and Weighted Automata (StatFSM 2016) (2016), S. 1–10

Drewes, Frank; Gebhardt, Kilian; Vogler, Heiko: EM-Training for Weighted Aligned Hypergraph Bimorphisms. In: Proceesings of the ACL Workshop on Statistical Natural Language Processing and Weighted Automata (StatFSM 2016) (2016), S. 60–69

Teichmann, Markus: Regular Approximation of Weighted Linear Nondeleting Context-Free Tree Languages. In: Proceedings of the 21st International Conference on Implementation and Application of Automata (CIAA 2016), Lecture Notes in Computer Science 9705 (2016), S. 273–284

Denkinger, Tobias: An Automata Characterisation for Multiple Context-Free Languages. In: Proceedings of the 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science 9840 (2016), S. 138–150

Herrmann, Luisa; Vogler, Heiko: Weighted Symbolic Automata with Data Storage. In: Proc. of 20th International Conference on Developments in Language Theory (DLT 2016), Lecture Notes in Computer Science 9840 (2016), S. 203–215

Osterholzer, Johannes; Dietze, Toni; Herrmann, Luisa: Linear Context-Free Tree Languages and Inverse Homomorphisms. In: Proceedings of the 10th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 9618 (2016), S. 478–489

Vogler, Heiko; Droste, Manfred; Herrmann, Luisa: A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem. In: Proceedings of the 10th International Conference on Language and Automata Theory and Applications, Lecture Notes in Computer Science 9618 (2016), S. 127–139

Osterholzer, Johannes: Complexity of Uniform Membership of Context-Free Tree Grammars. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science, Vol. 9270 (2015), S. 176–188

Osterholzer, Johannes; Dietze, Toni; Herrmann, Luisa: Linear Context-Free Tree Languages and Inverse Homomorphisms. In: Computing Research Repository (2015)

Dietze, Toni; Nederhof, Mark-Jan: Count-Based State Merging for Probabilistic Regular Tree Grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Gebhardt, Kilian; Osterholzer, Johannes: A direct link between Tree-Adjoining and Context-Free Tree Grammars. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Denkinger, Tobias: A Chomsky-Schützenberger representation for weighted multiple context-free languages. In: Proceedings of the 12th International Conference on Finite-State Methods and Natural Language Processing (FSMNLP 2015) (2015)

Fülöp, Zoltán; Vogler, Heiko: Characterizations of recognizable weighted tree languages by logic and bimorphisms (DOI 10.1007/s00500-015-1717-2). In: Soft Computing (2015)

Herrmann, Luisa; Vogler, Heiko: A Chomsky-Schützenberger Theorem for Weighted Automata with Storage. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science 9270 (2015), S. 115–127

Droste, Manfred; Heusel, Doreen; Vogler, Heiko: Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics. In: Proceedings of the 6th International Conference on Algebraic Informatics (CAI 2015), Lecture Notes in Computer Science 9270 (2015), S. 90–102

Fülöp, Zoltán; Vogler, Heiko: Characterizing Weighted MSO for Trees by Branching Transitive Closure Logics. In: Theoretical Computer Science 594 (2015), S. 82–105

Teichmann, Markus; Osterholzer, Johannes: A link between multioperator and tree valuation automata and logics. In: Theoretical Computer Science 594 (2015), S. 106–119

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: International Journal of Foundations of Computer Science 25 (2014), Nr. 8, S. 955–969

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected papers of the Workshop Weighted Automata: Theory and Applications (WATA 2012). Theoretical Computer Science 534, Nr. 1 (2014)

Osterholzer, Johannes: Pushdown Machines for Weighted Context-Free Tree Translation. In: Proceedings of 19th International Conference on Implementation and Application of Automata (CIAA 2014) (2014), S. 290–303

Fülöp, Zoltán; Vogler, Heiko: Forward and Backward Application of Symbolic Tree Transducers. In: Acta Informatica 51 (2014), S. 297–325

Nederhof, Mark-Jan; Vogler, Heiko: Hybrid Grammars for Discontinuous Parsing. In: Proceedings of the 25th International Conference on Computational Linguistics (COLING 2014): Technical Papers (2014)

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: Proceedings of the 17th International Conference on Developments in Language Theory (DLT 2013) (2013)

Büchse, Matthias; Koller, Alexander; Vogler, Heiko: General binarization for parsing and translation. In: Proceedings of 51st Annual Meeting of the Association for Computational Linguistics (2013)

Droste, Manfred; Vogler, Heiko: Weighted Automata and Multi-Valued Logics over Arbitrary Bounded Lattices. In: Theoretical Computer Science 418 (2012), S. 14–36

Fülöp, Zoltán; Stüber, Torsten; Vogler, Heiko: A Büchi-like theorem for weighted tree automata over multioperator monoids. In: Theory of Computing Systems 50 (2012), Nr. 2, S. 241–278

Stüber, Torsten: Multioperator Weighted Monadic Datalog. In: Ausgezeichnete Informatikdissertationen 2011, GI-Edition - Lecture Notes in Informatics (LNI), D-12 (2012)

Büchse, Matthias; Maletti, Andreas; Vogler, Heiko: Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. In: Proceedings of the 16th international conference on Developments in Language Theory (2012), S. 368–379

Nederhof, Mark-Jan; Vogler, Heiko: Synchronous Context-Free Tree Grammars. In: Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11) (2012), S. 55–63

Osterholzer, Johannes; Stüber, Torsten: State-Split for Hypergraphs with an Application to Tree Adjoining Grammars. In: Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11) (2012), S. 180–188

Büchse, Matthias; Fischer, Anja: 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 (2012)

Büchse, Matthias; Nederhof, Mark-Jan; Vogler, Heiko: Tree Parsing for Tree-Adjoining Machine Translation. In: Journal of Logic and Computation 22 (2012), Nr. 6

Stüber, Torsten: Consistency of Probabilistic Context-Free Grammars. In: Technical Reports (2012), S. 1–26

Droste, Manfred; Vogler, Heiko: The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages. In: arXiv:1208.3942v1 [cs.FL] (2012)

Fülöp, Zoltán; Maletti, Andreas; Vogler, Heiko: Weighted extended tree transducers. In: Fundamenta Informaticae 111 (2011), Nr. 2, S. 163–202

Büchse, Matthias ; Nederhof, Mark-Jan; Vogler, Heiko: Tree Parsing with Synchronous Tree-Adjoining Grammars. In: Proc. of 12th International Conference on Parsing Technologies (IWPT 2011), Association for Computational Linguistics (2011), S. 14–25

Droste, M. (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2010). Acta Cybernetica 20, Nr. 2 (2011)

Droste, Manfred; Vogler, Heiko: Weighted logics for unranked tree automata. In: Theory of Computing Systems 48 (2011), Nr. 1, S. 23–47

Droste, Manfred; Stüber, Torsten; Vogler, Heiko: Weighted finite automata over strong bimonoids. In: Information Sciences Vol 180 (2010), Nr. Issue 1, S. 156–166

Maletti, Andreas; Vogler, Heiko: Compositions of Top-Down Tree Transducers with ε-Rules. In: Finite-State Methods and Natural Language Processing, Lecture Notes in Computer Science Vol 6062 (2010), S. 69–80

May, Jonathan; Knight, Kevin; Vogler, Heiko: Efficient Inference Through Cascades of Weighted Tree Transducers. In: Proc. of 48th Annual Meeting of the Association for Computational Linguistics Vol. 1 (2010), S. 1058–1066

Büchse, Matthias; May, Jonathan; Vogler, Heiko: Determinization of weighted tree automata using factorizations. In: Journal of Automata, Languages and Combinatorics (2010)

Fülöp, Zoltán; Stüber, Torsten; Vogler, Heiko: A Büchi-Like Theorem for Weighted Tree Automata over Multioperator Monoids. In: Theory Comput Syst 50 (2010), Nr. 2, S. 163–202

Fülöp, Zoltán; Maletti, Andreas; Vogler, Heiko: Preservation of Recognizability for Syncronous Tree Substitution Grammars. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 1–9

Büchse, Matthias; Stüber, Torsten; Vogler, Heiko; Geisler, Daniel: n-Best Parsing Revisited. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 46–54

Geisler, Daniel; Stüber, Torsten: Weighted Monadic Datalog Tree Transducers. In: Technical Report TUD-FI10-07-Dezember 2010 (2010)

DeNeefe, Steve; Knight, Kevin; Vogler, Heiko: A Decoder for Probabilistic Syncronous Tree Insertion Grammars. In: Proc. of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing Vol. 1 (2010), S. 10–18

Droste, Manfred; Vogler, Heiko: Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices. In: Developments in Language Theory, Lecture Notes in Computer Science Vol. 6224 (2010), S. 160–172

Ćirić, Miroslav; Droste, Manfred; Ignjatović, Jelena; Vogler, Heiko: Determinization of weighted finite automata over strong bimonoids. In: Information Sciences, Information Sciences Vol. 180 (2010), Nr. Issue 18, S. 3497–3520

Fülöp, Zoltán; Maletti, Andreas; Vogler, Heiko: A Kleene theorem for weighted tree automata over distributive multioperator monoids. In: Theory of Computing Systems 44 (2009), Nr. 3, S. 455–499

Fülöp, Zoltán; Vogler, Heiko: Weighted tree automata and tree transducers. In: Handbook of Weighted Automata (2009), S. 313–403

Stüber, Torsten; Vogler, Heiko; Fülöp, Zoltán: Decomposition of Weighted Multioperator Tree Automata. In: Int. J. Foundations of Computer Sci. 20 (2009), Nr. 2, S. 221–245

Manfred, Droste; Werner, Kuich; Heiko, Vogler ; Manfred, Droste (Hrsg.): Handbook of Weighted Automata : Springer (2009)

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2008). Acta Cybernetica 19, Nr. 2. Szeged, Ungarn (2009)

Radovanovic, Dragica: Weighted Tree Automata over Strong Bimonoids. In: Technical Report TUD-FI09-02 TUD-FI09-02 (2009)

Voigtländer, Janis: Bidirectionalization for Free! In: Proceedings of the 36th Symposium on Principles of Programming Languages - POPL'09, rn36th Symposium on Principles of Programming Languages - POPL'09 (2009), S. 165–176

Stenger, Florian; Voigtländer, Janis: Parametricity for Haskell with Imprecise Error Semantics. In: Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications - TLCA'09 volume 5608 of LNCS (2009), S. 294–308

Büchse, Matthias; May, Jonathan; Vogler, Heiko: Determinization of weighted tree automata using factorizations. In: Finite-State Methods and Natural Language Processing - FSMNLP 2009, 8th International Workshop (2009)

Johann, Patricia; Voigtländer, Janis: A Family of Syntactic Logical Relations for the Semantics of Haskell-like Languages. In: Information and Computation 207(2) (2009), S. 341–368

Seidel, Daniel; Voigtländer, Janis: Taming Selective Strictness. In: ATPS'09 (2009)

Droste, Manfred (Hrsg.); Kuich, Werner (Hrsg.); Vogler, Heiko (Hrsg.): Handbook of Weighted Automata. EATCS Monographs in Theoretical Computer Science : Springer (2009)

Voigtländer, Janis: Free Theorems Involving Type Constructor Classes : 14th International Conference on Functional Programming - ICFP'09, Edinburgh, Scotland. In: Proceedings, ACM Press (2009)

Maletti, Andreas; Vogler, Heiko: Compositions of Top-down Tree Transducers with Epsilon-rules : in: Finite-State Methods and Natural Language Processing - FSMNLP 2009, 8th International Workshop. In: Proceedings (2009)

Droste, Manfred; Vogler, Heiko: Weighted logics for unranked tree automata. In: Theory of Computing Systems, accepted for publication, 2009 (2009)

Büchse, Matthias; Stüber, Torsten: Monadic Datalog Tree Transducers. In: Lecture Notes in Computer Science vol. 5457 (2009), S. 267–278

Högberg, Johanna; Maletti, Andreas; Vogler, Heiko: Bisimulation Minimisation of Weighted Automata on Unranked Trees. In: Fundamenta Informaticae 92(1-2) (2009), S. 103–130

Voigtländer, Janis: Proving Correctness via Free Theorems: The Case of the destroy/build-Rule. In: Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation - PEPM'08 (2008), S. 13–20

Voigtländer, Janis: Much Ado about Two: A Pearl on Parallel Prefix Computation. In: Proceedings of the 35th Symposium on Principles of Programming Languages - POPL'08; SIGPLAN Notices 43 (2008), Nr. 1, S. 29–35

Voigtländer, Janis: Semantics and Pragmatics of New Shortcut Fusion Rules. In: Proceedings of the 9th International Symposium on Functional and Logic Programming - FLOPS'08; LNCS 4989 (2008), S. 163–179

Högberg, Johanna; Maletti, Andreas; Vogler, Heiko: Bisimulation minimisation of weighted automata on unranked trees. In: Technical Report, Dresden University of Technology TUD-FI08-03 (2008)

Voigtländer, Janis: Asymptotic Improvement of Computations over Free Monads. In: Proceedings of the 9th International Conference on Mathematics of Program Construction - MPC'08; LNCS 5133 (2008), S. 388–403

Droste, Manfred; Sakarovitch, Jacques; Vogler, Heiko: Weighted Automata with Discounting. In: Information Processing Letters 108 (2008), pages 23-28 (2008)

Seselja, Branimir; Tepavcevic, Andreja; Vogler, Heiko: A note on cut-worthyness of recognizable tree series. In: Fuzzy Sets and Systems 159 (2008), 3087-3090 (2008)

Stüber, Torsten; Vogler, Heiko: Weighted monadic datalog. In: Theoretical Computer Science 403, pages 221-238 (2008)

Voigtländer, Janis; Stenger, Florian: Parametricity for Haskell with Imprecise Error Semantics. In: Technical Report, Dresden University of Technology TUD-FI08-08 (2008)

Voigtländer, Janis: Proving Correctness via Free Theorems: The Case of the destroy/build-Rule. In: PEPM'08, San Francisco, California, Proceedings, pages 13-20, ACM Press, (2008)

Drewes, Frank; Vogler, Heiko: Learning deterministically recognizable tree series. In: Journal of Automata, Languages and Combinatorics 12 (2007), Nr. 3, S. 332–354

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2006). Languages and Combinatorics 12, Nr. 4 (2007)

Maletti, A.: Compositions of extended top-down tree transducers. In: Proc. 1st Int. Conf. Language and Automata Theory and Applications. Report 35/07 (2007), S. 379–390

Maletti, A.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

Maletti, A.: Myhill-Nerode theorem for recognizable tree series revisited. In: Proc. 1st Int. Conf. AutoMathA: From Mathematics to Applications (2007)

Maletti, A.: Learning deterministically recognizable tree series revisited. In: Proc. 2nd Int. Conf. Algebraic Informatics LNCS 4728 (2007), S. 218–235

Högberg, J.; Maletti, Andreas; May, J.: Bisimulation minimisation for weighted tree automata. In: Proc. 11th Int. Conf. Developments in Language Theory LNCS 4588 (2007), S. 229–241

Högberg, J.; Maletti, Andreas; May, J.: Backward and forward bisimulation minimisation of tree automata. In: Proc. 12th Int. Conf. Implementation and Application of Automata LNCS 4783 (2007), S. 109–121

Giesl, J.; Kühnemann, Armin; Voigtländer, Janis: Deaccumulation Techniques for Improving Provability. In: Journal of Logic and Algebraic Programming (2007)

Voigtländer, Janis; Johann, P.: Selective strictness and parametricity in structural operational semantics, inequationally. In: Theoretical Computer Science 388 (2007), Nr. 1–3, S. 290–318

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems 41 (2007), Nr. 4, S. 619–689

Högberg, J.; Maletti, A.; May, J.: Backward and Forward Bisimulation Minimisation of Tree Automata. In: Technical Report ISI-TR-633 (2007)

Högberg, J.; Maletti, A.; May, J.: Bisimulation Minimisation of Weighted Tree Automata. In: Technical Report ISI-TR-634 (2007)

Vogler, H.; Fülöp, Z.; Maletti, A.: A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. In: Theory Comput. Syst. (2007)

Maletti, A.: Pure and O-Substitution. In: Int. J. Found. Comput. Sci. 18(4) (2007), S. 829–845

Maletti, A.; Vogler, H.: Incomparability Results for Classes of Polynomial Tree Series Transformations. In: J. Automata, Languages and Combinatorics (2007)

Johann, P.; Voigtländer, J.: The Impact of seq on Free Theorems-Based Program Transformations. In: Fundamenta Informaticae 69 (1-2) (2006), S. 63–102

Maletti, A.: Hierarchies of tree series transformations revisited. In: Proceedings of DLT 2006, Lecture Notes in Computer Science 4036 (2006), S. 215–225

Maletti, A.: Compositions of tree series transformations. In: Theoret. Comput. Sci. 366(3) (2006), S. 248–271

Kühnemann, A.; Maletti, A.: The Substitution Vanishes. In: Proceedings of AMAST 2006, Lecture Notes in Computer Science 4019 (2006), S. 173–188

Borchardt, B.; Maletti, A.; Seselja, B.; Tepavcevic, A.; Vogler, H.: Cut sets as recognizable tree languages. In: Fuzzy Sets and Syst. 157(11) (2006), S. 1560–1571

Maletti, A.: Does o-substitution preserve recognizability? In: Proceedings of CIAA 2006, Lecture Notes in Computer Science 4094 (2006), S. 150–161

Voigtländer, J.; Johann, P.: Selective Strictness and Parametricity in Structural Operational Semantics. In: Technical Report TUD-FI06-02, Technische Universität Dresden (2006)

Fülöp, Z.; Vogler, H.: A Comparison of Several Models of Weighted Tree Automata. In: Technical Report TUD-FI06-08, Technische Universität Dresden (2006)

Maletti, A.: Pure and O-Substitution. In: Technical Report TUD-FI06-05, Technische Universität Dresden (2006)

Droste, Manfred; Vogler, Heiko: Weighted Logics for XML. In: manuscript (2006)

Droste, M.; Vogler, H.: Weighted tree automata and weighted logics. In: Theoretical Computer Science 366 (2006), S. 228–247

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2004). Journal of Automata, Languages and Combinatorics 10, Nr. 2-3 (2005)

Borchardt, Björn; Fülöp, Zoltán; Gazdag, Zsolt; Maletti, Andreas: Bounds for tree automata with polynomial costs. In: Journal of Automata, Languages and Combinatorics 10 (2005), S. 107–157

Borchardt, Björn: Code Selection by Tree Series Transducers. In: 9th International Conference on Implementation and Application of Automata, CIAA'04, Kingston, Canada 3317 (2005), S. 57–67

Maletti, Andreas: The power of tree series transducers of type I and II. In: 9th International Conference on Developments in Language Theory, DLT 2005, Palermo, Italy 3572 (2005), S. 338–349

Maletti, A.: Compositions of bottom-up tree series transformations. In: Proceedings 11th International Conference on Automata and Formal Languages, University of Szeged (2005), S. 187–199

Maletti, A.: HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. In: Theoretical Computer Science (2005)

Maletti, A.; Vogler, H.: Incomparability Results for Classes of Polynomial Tree Series Transformations. In: Journal of Automata, Languages and Combinatorics (2005)

Maletti, A.: Compositions of Tree Series Transformations. In: Technical Report TUD-FI05-05 (2005)

Giesl, J.; Kühnemann, A.; Voigtländer, J.: Deaccumulation Techniques for Improving Provability. In: Technical Report TUD-FI05-14 (2005), S. 1–50

Droste, Manfred; Pech, Christian; Vogler, Heiko: A Kleene theorem for weighted tree automata. In: Theory Comput. Syst. 38 (2005), S. 1–38

Maletti, A.: Relating tree series transducers and weighted tree automata. In: International Journal of Foundations of Computer Science 16(4) (2005), S. 723–741

Johann, P.; Voigtländer, J.: The impact of seq on Free Theorems-Based Program Transformations. In: Fundamenta Informaticae (2005)

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Theory of Computing Systems (2005)

Borchardt, B.; Maletti, A.; Seselja, B.; Tepavcevic, A.; Vogler, H.: Cut sets as Recognizable Tree Languages. In: Fuzzy Sets and Systems (2005)

Droste, M.; Vogler, H.: Recognizable and Rational Formal Power Series with General Discounting. In: Technical Report TUD-FI05-06 (2005)

Fülöp, Z.; Muzamel, L.: Decomposition Results for Pebble Macro Tree Transducers. In: Technical Report TUD-FI05-13 (2005), S. 1–41

Fülöp, Z.; Kühnemann, A.; Vogler, H.: Linear deterministic multi bottom-up tree transducers. In: Theoretical Computer Science 347 (2005), S. 276–287

Johann, P.; Voigtländer, J.: Free Theorems in the Presence of seq. In: 31st Symposium on Principles of Programming Languages - POPL'04, Venice, Italy, Proceedings, SIGPLAN Notices 39 (2004), S. 99–110

Voigtländer, J.; Kühnemann, A.: Composition of functions with accumulating parameters. In: Journal of Functional Programming 14 (2004), S. 317–363

Voigtländer, J.: Using Circular Programs to Deforest in Accumulating Parameters. In: Higher-Order and Symbolic Computation 17 (2004), S. 129–163

Borchardt, B.: A Pumping Lemma and Decidability Problems for Recognizable Tree Series. In: Acta Cybernetica 16 (2004), S. 509–544

Maletti, A.: Inclusion Diagrams for Classes of Deterministic Bottom-up Tree-to-Tree-Series Transformations. In: Technical Report TUD-FI04-07 (2004), S. 1–34

Vogler, H.: φ-Recognizable Formal Power Series are φ-Rational - An Alternative Proof. In: Technical Report TUD-FI04-06 (2004), S. 1–18

Voigtländer, J.: Formal Efficiency Analysis for Tree Transducer Composition. In: Technical Report TUD-FI04-08 (2004), S. 1–93

Maletti, A.: Relating Tree Series Transducers and Weighted Tree Automata. In: Proc. 8th Int. Conf. Developments in Language Theory, LNCS 3340 (2004), S. 321–333

Maletti, Andreas: Myhill-Nerode theorem for sequential transducers over unique GCD-monoids. In: Proceedings of the 9th International Conference on Implementation and Application of Automata, LNCS 3317 (2004), S. 323–324

Jürgensen, C.; Vogler, H.: Syntactic composition of top-down tree transducers is short cut fusion. In: Mathematical Structures in Computer Science 14 (2004), S. 215–282

Droste, M.; Vogler, H.: Weighted Automata: Theory and Applications. In: Technical Report TUD-FI04-05 (2004), S. 1–61

Fülöp, Z.; Gazdag, Zs.; Vogler, H.: Hierarchies of Tree Series Transformations. In: Theoretical Computer Science 314 (2004), S. 387–429

Fülöp, Z.; Kühnemann, A.; Vogler, H.: A Bottom-up Characterization of Deterministic Top-down Tree Transducers with Regular Look-Ahead. In: Information Processing Letters 91 (2004), S. 57–67

Pöschel, R.; Semigrodskikh, A.; Vogler, H.: On clones of tree functions closed under primitive recursion. In: Acta Cybernetica 16 (2004), S. 411–425

Fülöp, Z.; Vogler, H.: Weighted tree transducers. In: Journal of Automata, Languages and Combinatorics 9 (2004), S. 31–54

Droste, Manfred (Hrsg.); Vogler, Heiko (Hrsg.): Selected Papers of the Workshop Weighted Automata: Theory and Applications (WATA 2002). Journal of Automata, Languages and Combinatorics 8 (2003)

Borchardt, Björn: The Myhill-Nerode theorem for recognizable tree series. In: 7th International Conference on Developments in Language Theory, DLT'03, Szeged, Hungary 2710 (2003), S. 146–158

Borchardt, Björn; Vogler, Heiko: Determinization of finite state weighted tree automata. In: J. Autom. Lang. Comb. 8 (2003), Nr. 3, S. 417–463

Giesl, Jürgen; Kühnemann, Armin; Voigtländer, Janis: Deaccumulation — Improving Provability. In: 8th Asian Computing Science Conference, ASIAN 2003 2896 (2003), S. 146–160

Fülöp, Zoltán; Vogler, Heiko: Tree series transformations that respect copying. In: Theory Comput. Syst. 36 (2003), Nr. 3, S. 247–293

Voigtländer, Janis: Conditions for efficiency improvement by tree transducer composition. In: 13th International Conference on Rewriting Techniques and Applications 2378 (2002), S. 222–236

Voigtländer, Janis: Using Circular Programs to Deforest in Accumulating Parameters. In: ASIAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation (2002)

Voigtländer, Janis: Concatenate, reverse and map vanish for free. In: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming - ICFP ’02 (2002), S. 14–25

Engelfriet, Joost; Fülöp, Zoltán; Vogler, Heiko: Bottom-up and top-down tree series transformations. In: Journal of Automata, Languages and Combinatorics 7 (2001), Nr. 1, S. 11–70

Kühnemann, Armin; Glück, R.; Kakehi, K.: Relating Accumulative and Non-Accumulative Functional Programs. In: 12th International Conference on Rewriting Techniques and Applications -- RTA'01, Utrecht, The Netherlands, Proceedings 2051 (2001), S. 154–168

Kühnemann, Armin; Voigtländer, Janis: Tree Transducer Composition as Deforestation Method for Functional Programs. In: TUD-FI01 - 07 - August 2001 (2001)

Voigtländer, Janis; Kühnemann, Armin: Composition of Functions with Accumulating Parameters. In: TUD-FI01-08 (2001)

Noll, T.; Vogler, Heiko: The universality of higher-order attributed tree transducers. In: Theory of Computing Systems 34 (2001), Nr. 1, S. 45–75

Kühnemann, Armin: Attribute Grammars and Program Optimization (2001)

Jürgensen, Claus: A Formalization of Hylomorphism Based Deforestation with an Application to an Extended Typed λ-Calculus. In: TUD-FI00-13 (2000)

Kühnemann, Armin: Benefits of tree transducers for optimizing functional programs. In: International Colloquium “Partial Evaluation and Program Transformation”, Waseda University (2000), S. 61–82

Kühnemann, Armin: Elimination of Intermediate Results in Functional Programs. In: Workshop Programmiersprachen und Grundlagen der Programmierung 263 (2000), Nr. 1/2000, S. 105–112

Vogler, Heiko (Hrsg.): International Workshop on Grammars, Automata, and Logic on Graphs and Trees. Dresden, Germany (1999)

Kühnemann, Armin: Comparison of deforestation techniques for functional programs and for tree transducers. In: TUD-FI99-01 (1999)

Kühnemann, Armin: Comparison of deforestation techniques for functional programs and for tree transducers. In: 4th Fuji International Symposium on Functional and Logic Programming - FLOPS'99, Tsukuba 1722 (1999), S. 114–130

Hofstedt, P.: A Functional Logic Language as Hostlanguage for a System of Combined Constraint Solvers. In: Proceedings of the 8th International Conference on Functional and Logic Programming (1999)

Fülöp, Zoltán; Vogler, Heiko: A Characterization of Attributed Tree Transformations by a Subclass of Macro Tree Transducers. In: Theory of Comput. Systems 32 (1999), S. 649–676

Engelfriet, Joost; Vogler, Heiko: The Equivalence of Bottom-Up and Top-Down Tree-to-Graph Transducers. In: Journal of Computer and System Sciences 56 (1998), S. 332–356

Kühnemann, Armin: Benefits of tree Transducers for optimizing functional programs. In: Proceedings of the 18th International Conference on Foundations of Software Technology and Theoretical Computer Science, FST and TCS 1998 1530 (1998), S. 146–157

Maneth, S.; Vogler, Heiko: Attributed context-free hypergraph grammars. In: Automata, Languages and Combinatorics 2 (1998), S. 105–147

Fülöp, Zoltán; Vogler, Heiko: Syntax-directed semantics. Monographs in Theoretical Computer Science : Springer (1998)

Mößle, A.; Vogler, Heiko: Benefits of Hypergraphs for Program Transformation. In: Proceedings Informatik '97 (1997), S. 572–581

Kühnemann, Armin: A two-dimensional hierarchy for attributed tree transducers. In: Proceeding of the 11th International Symposium on Fundamentals of Computation Theory (1997), S. 281–292

Kühnemann, Armin; Vogler, Heiko: Attributgrammatiken : Vieweg (1997)

Kühnemann, Armin: A pumping lemma for output languages of macro tree transducers. In: Proceedings of the 21st International Colloquium on Trees in Algebra and Programming – CAAP'96 1059 (1996), S. 44–58

Faßbender, H.; Mößle, A.; Vogler, Heiko: Implementation of a deterministic partial E-unification algorithm for macro tree transducers. In: Journal of Functional and Logic Programming (1996), Nr. 2

Vogler, Heiko (Hrsg.): Arbeitstreffen über: Grundlagen, Spezifikation, Implementierung und Verifikation von Programmiersprachen. Dresden, Germany (1996)

Kühnemann, Armin; Vogler, Heiko: Synthesized and inherited functions. In: Acta Informatica 31 (1994), Nr. 5, S. 431–477

Kühnemann, Armin; Vogler, Heiko: A pumping lemma for output languages of attributed tree transducers. In: Acta Cybernet. 11 (1994), S. 261–305

Noll, T.; Vogler, Heiko: Top-down parsing with simultaneous attribute evaluation. In: Fund. Inform. 20 (1994), S. 285–332

Faßbender, H.; Vogler, Heiko: A universal unification algorithm based on unification-driven leftmost outermost narrowing. In: Acta Cybernet. 11 (1994), S. 139–167

Engelfriet, Joost; Vogler, Heiko: The translation power of top-down tree-to-graph transducers. In: Journal of Computer and System Sciences 49 (1994), Nr. 2, S. 258–305

Fülöp, Zoltán; Herrmann, F.; Vagvölgyi, S.; Vogler, Heiko: Tree transducers with external functions. In: Theoret. Comput. Sci. 108 (1993), S. 185–236

Faßbender, H.; Vogler, Heiko: An implementation of syntax directed functional programming on nested-stack machines. In: Formal Aspects of Comput. 4 (1992), S. 341–375

Engelfriet, J.; Vogler, H.: Modular tree transducers. In: Theoret. Comput. Sci. 78 (1991), S. 267–303

Vogler, Heiko: Functional description of the contextual analysis in block — structured programming languages: a case study of tree transducers. In: Science of Comput. Prog. 16 (1991), S. 251–275

Engelfriet, Joost; Vogler, Heiko: High level tree transducers and iterated pushdown tree transducers. In: Acta Inform. 26 (1988), S. 131–192

Vogler, Heiko: The OI-hierarchy is closed under control. In: Inform. and Comput. 78 (1988), S. 187–204

Engelfriet, Joost; Vogler, Heiko: Look-ahead on pushdowns. In: Inform. and Comput. 73 (1987), S. 245–279

Vogler, Heiko: Basic tree transducers. In: J. Comput. System Sci. 34 (1987), S. 87–128

Engelfriet, Joost; Vogler, Heiko: Pushdown machines for the macro tree transducer. In: Theoret. Comput. Sci. 42 (1986), Nr. 3, S. 251–368

Vogler, Heiko: Iterated linear control and iterated one-turn pushdowns. In: Math. Systems Theory 19 (1986), S. 117–133

Engelfriet, Joost; Vogler, Heiko: Macro tree transducers. In: J. Comput. System Sci. 31 (1985), S. 71–146


Diese Informationen werden vom FIS bereitgestellt.
Last modified: 30th Apr 2017, 2.49 PM
Author: Dipl.-Inf. Tobias Denkinger